Weak essentially undecidable theories of concatenation, part II

Archive for Mathematical Logic 63 (3):353-390 (2024)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Weak essentially undecidable theories of concatenation.Juvenal Murwanashyaka - 2022 - Archive for Mathematical Logic 61 (7):939-976.
Weak Theories of Concatenation and Arithmetic.Yoshihiro Horihata - 2012 - Notre Dame Journal of Formal Logic 53 (2):203-222.
Weak theories of linear algebra.Neil Thapen & Michael Soltys - 2005 - Archive for Mathematical Logic 44 (2):195-208.
A note on weak dividing.Byunghan Kim & Niandong Shi - 2007 - Archive for Mathematical Logic 46 (2):51-60.
Arithmetic on semigroups.Mihai Ganea - 2009 - Journal of Symbolic Logic 74 (1):265-278.
A note on the schemes of replacement and collection.A. R. D. Mathias - 2007 - Archive for Mathematical Logic 46 (1):43-50.
Partially definable forcing and bounded arithmetic.Albert Atserias & Moritz Müller - 2015 - Archive for Mathematical Logic 54 (1):1-33.
A Weak Essentially Undecidable Theory.Kamila Bendova - 2007 - Reports on Mathematical Logic.
Lowness for genericity.Liang Yu - 2006 - Archive for Mathematical Logic 45 (2):233-238.
Well-foundedness in Realizability.M. Hofmann, J. Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.
Preface.Douglas Cenzer & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):529-531.

Analytics

Added to PP
2023-11-03

Downloads
18 (#836,872)

6 months
16 (#160,768)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

A Decision Method for Elementary Algebra and Geometry.Alfred Tarski - 1952 - Journal of Symbolic Logic 17 (3):207-207.
Undecidability without Arithmetization.Andrzej Grzegorczyk - 2005 - Studia Logica 79 (2):163-230.
Growing Commas. A Study of Sequentiality and Concatenation.Albert Visser - 2009 - Notre Dame Journal of Formal Logic 50 (1):61-85.
Arithmetic on semigroups.Mihai Ganea - 2009 - Journal of Symbolic Logic 74 (1):265-278.

View all 8 references / Add more references