AXIOMS FOR FINITE COLLAPSE MODELS OF ARITHMETIC
From MaRDI portal
Recommendations
- Theories of arithmetics in finite models
- Models of arithmetic and categories with finiteness conditions
- scientific article; zbMATH DE number 1302878
- scientific article; zbMATH DE number 803291
- Finite Model Theory
- Finite axiomatizability and theories with trivial algebraic closure
- Existentially closed models in the framework of arithmetic
- Arithmetical definability over finite structures
- Publication:3487326
- On cofinal extensions of models of arithmetic
Cites work
- A note on naive set theory in LP
- A note on Priest's finite inconsistent arithmetics
- A theorem in 3-valued model theory with connections to number theory, type theory, and relevant logic
- Inconsistent models for relevant arithmetics
- Inconsistent models of arithmetic. I: Finite models
- Inconsistent models of arithmetic. II: The general case
- Natural 3-valued logics—characterization and proof theory
- On LP-models of arithmetic
- There's something about Gödel. The complete guide to the incompleteness theorem. Transl. from the Italian
- Whither relevant arithmetic?
Cited in
(11)- Second-order logic of paradox
- K3, Ł3, LP, RM3, A3, FDE, M: how to make many-valued logics work for you
- Variations on the collapsing lemma
- Some Comments and Replies
- Some Lessons Learned About Adding Conditionals to Certain Many-Valued Logics
- On LP-models of arithmetic
- Categoricity problem for LP and K3
- Is there an inconsistent primitive recursive relation?
- Gates and circuits via Dunn semantics
- A note on the strength of paraconsistent arithmetic
- Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic
This page was built for publication: AXIOMS FOR FINITE COLLAPSE MODELS OF ARITHMETIC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195589)
