- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Weak essentially undecidable theories of concatenation, part II
Archive for Mathematical Logic 63 (3):353-390 (2024)
Abstract
We show that we can interpret concatenation theories in arithmetical theories without coding sequences by identifying binary strings with \(2\times 2\) matrices with determinant 1.My notes
Similar books and articles
Mutual Interpretability of Weak Essentially Undecidable Theories.Zlatan Damnjanovic - 2022 - Journal of Symbolic Logic 87 (4):1374-1395.
Weak essentially undecidable theories of concatenation.Juvenal Murwanashyaka - 2022 - Archive for Mathematical Logic 61 (7):939-976.
Weak theories of linear algebra.Neil Thapen & Michael Soltys - 2005 - Archive for Mathematical Logic 44 (2):195-208.
Essential hereditary undecidability.Albert Visser - 2024 - Archive for Mathematical Logic 63 (5):529-562.
Partially definable forcing and bounded arithmetic.Albert Atserias & Moritz Müller - 2015 - Archive for Mathematical Logic 54 (1):1-33.
Model completeness for trivial, uncountably categorical theories of Morley rank 1.Alfred Dolich, Michael C. Laskowski & Alexander Raichev - 2006 - Archive for Mathematical Logic 45 (8):931-945.
Weak Theories of Concatenation and Arithmetic.Yoshihiro Horihata - 2012 - Notre Dame Journal of Formal Logic 53 (2):203-222.
On locally modular, weakly minimal theories.James Loveys - 1993 - Archive for Mathematical Logic 32 (3):173-194.
Analytics
Added to PP
2023-11-03
Downloads
18 (#828,658)
6 months
16 (#216,782)
2023-11-03
Downloads
18 (#828,658)
6 months
16 (#216,782)
Historical graph of downloads
References found in this work
Undecidable Theories.Alfred Tarski, Andrzej Mostowski & Raphael M. Robinson - 1953 - Philosophy 30 (114):278-279.
A Decision Method for Elementary Algebra and Geometry.Alfred Tarski - 1952 - Journal of Symbolic Logic 17 (3):207-207.
Growing Commas. A Study of Sequentiality and Concatenation.Albert Visser - 2009 - Notre Dame Journal of Formal Logic 50 (1):61-85.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-xdvnm uwo