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):
Displayed 4 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)
- Decidability of the theory of the natural integers with the Cantor pairing function and the successor (Q5941253) (← links)
