Restricted Set-Theoretical Definitions in Arithmetic
From MaRDI portal
Publication:3848968
DOI10.2307/2033144zbMath0112.00702OpenAlexW4245063106MaRDI QIDQ3848968
Publication date: 1958
Full work available at URL: https://doi.org/10.2307/2033144
Related Items
Decision Problems of Finite Automata Design and Related Arithmetics, Measure Quantifier in Monadic Second Order Logic, On decidability of monadic logic of order over the naturals extended by monadic predicates, Generalized finite automata theory with an application to a decision problem of second-order logic, Undecidability of the first-order arithmetic \(A[P(x),2x,x+1\)], On translations of temporal logic of actions into monadic second-order logic, Composition Over the Natural Number Ordering with an Extra Binary Relation, A note on undecidable extensions of monadic second order successor arithmetic, The recursive sets in certain monadic second order fragments of arithmetic, The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates, Decidable Expansions of Labelled Linear Orderings, Tree acceptors and some of their applications, Decidable Extensions of Church’s Problem, Generalized finite automata theory with an application to a decision problem of second-order logic
