Pages that link to "Item:Q4644608"
From MaRDI portal
The following pages link to A combinatorial version of the Svenonius theorem on definability (Q4644608):
Displaying 8 items.
- A combinatorial result related to the consistency of New Foundations (Q638501) (← links)
- Discrete versions of the Beckman-Quarles theorem from the definability results of R. M. Robinson (Q2765390) (← links)
- Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic (Q3335777) (← links)
- Stepping up lemmas in definable partitions (Q3695278) (← links)
- On the existence of <i>n</i> but not <i>n</i> + 1 easy combinators (Q4704761) (← links)
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants (Q4917988) (← links)
- Lattice of definability (of reducts) for integers with successor (Q5033990) (← links)
- The lattice of definability: origins, recent developments, and further directions (Q6132481) (← links)