Decidability and essential undecidability
From MaRDI portal
Publication:3245363
DOI10.2307/2964057zbMath0078.24501OpenAlexW2021891065MaRDI QIDQ3245363
Publication date: 1957
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2964057
Related Items (14)
Refuting learning revisited. ⋮ Learning power and language expressiveness. ⋮ Decision Problems of Finite Automata Design and Related Arithmetics ⋮ Minimal- und Primmodelle ⋮ A note on definability in fragments of arithmetic with free unary predicates ⋮ Undecidability of the first-order arithmetic \(A[P(x),2x,x+1\)] ⋮ The reachability problem for Petri nets and decision problems for Skolem arithmetic ⋮ Positive existential definability of multiplication from addition and the range of a polynomial ⋮ A list of arithmetical structures complete with respect to the first-order definability ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ Essential hereditary undecidability ⋮ Facets of Synthesis: Revisiting Church’s Problem ⋮ Bibliography of Hilary Putnam’s Writings in Logic and Mathematics ⋮ Creativity and Effective Inseparability
This page was built for publication: Decidability and essential undecidability
