Decidability and Specker sequences in intuitionistic mathematics
From MaRDI portal
Publication:3650323
Recommendations
- Completeness and Decidability in Sequence Logic
- Decidability in the logic of subsequences and supersequences
- Decidability and \(k\)-regular sequences
- Sequent logic of arithmetic decidability
- scientific article; zbMATH DE number 1916517
- Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories
- The development of decidability proofs based on sequent calculi
- Decidability in elementary analysis. II
- Consistency and decidability in some paraconsistent arithmetics
- Decidability in elementary analysis. I
Cites work
- scientific article; zbMATH DE number 4002093 (Why is no real title available?)
- scientific article; zbMATH DE number 1462097 (Why is no real title available?)
- scientific article; zbMATH DE number 3216177 (Why is no real title available?)
- An interpretation of intuitionistic analysis
- Constructivism in mathematics. An introduction. Volume I
- Nicht konstruktiv beweisbare Sätze der Analysis
- Specker sequences revisited
Cited in
(9)- Specker sequences revisited
- scientific article; zbMATH DE number 510786 (Why is no real title available?)
- Intuitionistic notions of boundedness in ℕ
- The principle of open induction and Specker sequences
- Some effects of Ash-Nerode and other decidability conditions on degree spectra
- scientific article; zbMATH DE number 1916517 (Why is no real title available?)
- scientific article; zbMATH DE number 3171974 (Why is no real title available?)
- On the constructive notion of closure maps
- The double negation of the intermediate value theorem
This page was built for publication: Decidability and Specker sequences in intuitionistic mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3650323)
