Pages that link to "Item:Q5941257"
From MaRDI portal
The following pages link to A list of arithmetical structures complete with respect to the first-order definability (Q5941257):
Displaying 10 items.
- A note on definability in fragments of arithmetic with free unary predicates (Q365661) (← links)
- Computational complexity of logical theories of one successor and another unary function (Q868664) (← links)
- On arithmetical first-order theories allowing encoding and decoding of lists (Q1960537) (← links)
- The theory of ceers computes true arithmetic (Q2187270) (← links)
- Some new results in monadic second-order arithmetic (Q3195649) (← links)
- INTERPRETING ARITHMETIC IN THE FIRST-ORDER THEORY OF ADDITION AND COPRIMALITY OF POLYNOMIAL RINGS (Q5195064) (← links)
- DECIDABILITY AND CLASSIFICATION OF THE THEORY OF INTEGERS WITH PRIMES (Q5359574) (← links)
- Decidability of the theory of the natural integers with the Cantor pairing function and the successor (Q5941253) (← links)
- The lattice of definability: origins, recent developments, and further directions (Q6132481) (← links)
- Positive existential Definability with unit, addition and coprimeness (Q6666557) (← links)
