Decidability and Specker sequences in intuitionistic mathematics
From MaRDI portal
Publication:3650323
DOI10.1002/MALQ.200710094zbMATH Open1192.03046OpenAlexW2030330301MaRDI QIDQ3650323FDOQ3650323
Authors: Mohammad Ardeshir, Rasoul Ramezanian 
Publication date: 14 December 2009
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200710094
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
Decidability of theories and sets of sentences (03B25) Intuitionistic mathematics (03F55) Constructive and recursive analysis (03F60)
Cites Work
Cited In (9)
- Specker sequences revisited
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
