Pages that link to "Item:Q365661"
From MaRDI portal
The following pages link to A note on definability in fragments of arithmetic with free unary predicates (Q365661):
Displaying 9 items.
- Notes on the computational aspects of Kripke's theory of truth (Q526739) (← links)
- The definable criterion for definability in Presburger arithmetic and its applications. (Q1401169) (← links)
- Predicate logics of decidable fragments of arithmetic (Q1406364) (← links)
- Reasoning about arbitrary natural numbers from a Carnapian perspective (Q2323694) (← links)
- Some new results in monadic second-order arithmetic (Q3195649) (← links)
- Presburger arithmetic with unary predicates is <i>Π</i><sub>1</sub><sup>1</sup> complete (Q3984438) (← links)
- Quantifying over events in probability logic: an introduction (Q4593244) (← links)
- Subclasses of presburger arithmetic and the weak EXP hierarchy (Q4635632) (← links)
- Elementary invariants for quantified probability logic (Q6095192) (← links)