On LP-models of arithmetic
From MaRDI portal
Publication:5387309
DOI10.2178/JSL/1208358750zbMATH Open1143.03013OpenAlexW2092950301MaRDI QIDQ5387309FDOQ5387309
Authors: Jeff Paris, Alla Sirokofskich
Publication date: 8 May 2008
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jsl/1208358750
Recommendations
Cites Work
Cited In (10)
- On paraconsistent downward Löwenheim-Skolem theorems
- Algebra-valued models for LP-set theory
- Some Comments and Replies
- On elimination of quantifiers in some non-classical mathematical theories
- New arguments for adaptive logics as unifying frame for the defeasible handling of inconsistency
- The scope of Gödel's first incompleteness theorem
- Title not available (Why is that?)
- AXIOMS FOR FINITE COLLAPSE MODELS OF ARITHMETIC
- \(\text{NP}\not={co}\)-NP and models of arithmetic
- Inconsistent models (and infinite models) for arithmetics with constructible falsity
This page was built for publication: On LP-models of arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387309)