Some new results in monadic second-order arithmetic
From MaRDI portal
Recommendations
- A note on definability in fragments of arithmetic with free unary predicates
- Definability and decidability issues in extensions of the integers with the divisibility predicate
- scientific article; zbMATH DE number 4055587
- scientific article; zbMATH DE number 4110684
- scientific article; zbMATH DE number 3926911
Cites work
- A list of arithmetical structures complete with respect to the first-order definability
- A note on definability in fragments of arithmetic with free unary predicates
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Definability and decision problems in arithmetic
- Definability, decidability, complexity
- scientific article; zbMATH DE number 1192199 (Why is no real title available?)
- scientific article; zbMATH DE number 472855 (Why is no real title available?)
- On Pascal triangles modulo a prime power
- Presburger arithmetic with unary predicates is Π11 complete
- The theory of integer multiplication with order restricted to primes is decidable
- Undecidable extensions of Skolem arithmetic
Cited in
(6)- scientific article; zbMATH DE number 4051591 (Why is no real title available?)
- Notes on the computational aspects of Kripke's theory of truth
- Improved witnessing and local improvement principles for second-order bounded arithmetic
- On the coprimeness relation from the viewpoint of monadic second-order logic
- An `elementary' perspective on reasoning about probability spaces
- Sharpening complexity results in quantified probability logic
This page was built for publication: Some new results in monadic second-order arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195649)
