7 problems
- 0 votes0 replies0 views
The MSO counting-logic conjecture for bounded arithmetic
Let be monadic second-order logic with the Härtig quantifier, and call an arithmetical predicate directly definable when it is defined by the logic in t…
- 0 votes0 replies0 views
Galeotti, Khomskii and Väänänen's characterization of the upward LST number of second-order logic
Let denote the upward Löwenheim–Skolem–Tarski number of full second-order logic, when it exists: the least cardinal such that every suf…
- 0 votes0 replies0 views
The ULST conjecture for second-order logic
The ULST conjecture. The strength of the existence of is exactly that of an extendible cardinal; equivalently, the number f…
- 0 votes0 replies0 views
The critical-period conjecture for set theory and Hilbert's program
Critical-period conjecture. The critical period of set theory will be realized with the advent of second-order logic and the revival of Hilbert's program.
- 0 votes0 replies0 views
Non-equivalence of the negation of Yablo's paradox with first-order theories
Let be the second-order sentence formalizing Yablo's paradox, and let denote its negation. A first-order theory is a set of first-order sentences in…
- 0 votes0 replies1 view
Internal normalization conjecture for impredicative type theory with a type of all types
Internal normalization conjecture. A normalization argument for might be formalizable in itself.
- 0 votes0 replies0 views
Henkin-style second-order expressibility conjecture for NDL
Let be the generalized dynamic logic discussed in the paper, and let Henkin-style second-order logic (HSOL) be the corresponding Henkin semantics for second-order logic. A pr…