15 problems
- 0 votes0 replies0 views
Grygiel–Lescanne conjecture on binary lambda-term enumeration
Let be the number of free indices and let be the size of a binary lambda term, encoded as a binary word of length according to Tromp's weights. Let…
- 0 votes0 replies0 views
Berline's conjecture on recursively enumerable theories of graph models
Berline's conjecture. No graph model has an r.e. theory.
- 0 votes0 replies0 views
Prawitz's Normalization Conjecture for identity of proofs
Let derivations be derivations in natural deduction, and let a derivation be reduced to a normal form by the normalization procedures of the system. Prawitz's Normalization Conject…
- 0 votes0 replies1 view
Cartesian closed 2-category of pseudo--algebras
Let be the pseudomonad whose discrete pseudoalgebras are continuous lattices, and let denote its category of pseudoalg…
- 0 votes0 replies0 views
The conjecture relating openness of lambda-terms to linearity
Openness-linearity conjecture. The notion of openness may be related to linearity.
- 0 votes0 replies0 views
Zeilberger–Reed conjecture on 3-connected planar linear normal lambda-terms
A planar linear normal -term is a linear normal -term whose syntactic diagram is planar; call it 3-connected when its syntactic diagram is 3-connected. For…
- 0 votes0 replies0 views
The correspondence between ILCμ and dual-calculus evaluation strategies
Let denote the relevant unity-of-logic calculus, and let the dual calculus have call-by-name and call-by-value substructural calculi. Correspondence conjecture.…
- 0 votes0 replies0 views
The syntax-and-semantics refinement conjecture for call-by-value lambda-calculus
The paper studies a call-by-value setting in which execution time is measured by the number of -steps leading to a normal form, if any, using a relational denotational s…
- 0 votes0 replies0 views
The conjecture that classical variables and the new rules do not increase lambda-calculus complexity
Computational-complexity conjecture. The computational complexity of the -calculus is not enhanced by the introduction of the classical variables and the new rules.
- 0 votes0 replies0 views
Equinumerosity conjecture for a natural family of lambda terms and bridgeless maps
Rooted bridgeless maps are a class of combinatorial maps, and the paper considers a certain natural family of lambda terms associated with the same enumerative setting. Equinumeros…
- 0 votes0 replies0 views
The three-function conjecture for numeral systems
Three-function conjecture. There are no total recursive functions such that, for all numeral systems, the functions represented using the system inclu…
- 0 votes0 replies0 views
Non-recursive enumerability for effective models in continuous semantics
Continuous-semantics conjecture. All the effective models living in the continuous semantics have non-r.e. equational theories.
- 0 votes0 replies0 views
Non-recursive enumerability for effective graph models
Effective graph-model conjecture. All the effective graph models have non-r.e. equational theories.
- 0 votes0 replies0 views
Non-recursive enumerability of the minimum equational graph theory
Minimum-theory conjecture. The minimum equational graph theory is non-r.e.
- 0 votes0 replies0 views
Scott-semantics conjecture on recursively enumerable equational theories
Scott-semantics conjecture. No -model living in Scott's continuous semantics or in one of its refinements has an r.e. equational theory.