- 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
First-order concatenation theory with bounded quantifiers
Archive for Mathematical Logic 60 (1):77-104 (2020)
Abstract
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.My notes
Similar books and articles
Quantifiers and congruence closure.Jörg Flum, Matthias Schiehlen & Jouko Väänänen - 1999 - Studia Logica 62 (3):315-340.
Preservation theorems for bounded formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.
Mutual Interpretability of Weak Essentially Undecidable Theories.Zlatan Damnjanovic - 2022 - Journal of Symbolic Logic 87 (4):1374-1395.
Separations of first and second order theories in bounded arithmetic.Masahiro Yasumoto - 2005 - Archive for Mathematical Logic 44 (6):685-688.
Automatic structures of bounded degree revisited.Dietrich Kuske & Markus Lohrey - 2011 - Journal of Symbolic Logic 76 (4):1352-1380.
Degrees of logics with Henkin quantifiers in poor vocabularies.Marcin Mostowski & Konrad Zdanowski - 2004 - Archive for Mathematical Logic 43 (5):691-702.
Elementary theories and hereditary undecidability for semilattices of numberings.Nikolay Bazhenov, Manat Mustafa & Mars Yamaleev - 2019 - Archive for Mathematical Logic 58 (3-4):485-500.
Non-Fregean Propositional Logic with Quantifiers.Joanna Golińska-Pilarek & Taneli Huuskonen - 2016 - Notre Dame Journal of Formal Logic 57 (2):249-279.
Quantified propositional calculus and a second-order theory for NC1.Stephen Cook & Tsuyoshi Morioka - 2005 - Archive for Mathematical Logic 44 (6):711-749.
First-order theories of bounded trees.Ruaan Kellerman - 2021 - Archive for Mathematical Logic 61 (1):263-297.
Analytics
Added to PP
2020-05-23
Downloads
7 (#603,698)
6 months
3 (#1,723,834)
2020-05-23
Downloads
7 (#603,698)
6 months
3 (#1,723,834)
Historical graph of downloads
Citations of this work
Weak essentially undecidable theories of concatenation.Juvenal Murwanashyaka - 2022 - Archive for Mathematical Logic 61 (7):939-976.
Weak essentially undecidable theories of concatenation, part II.Juvenal Murwanashyaka - 2024 - Archive for Mathematical Logic 63 (3):353-390.
References found in this work
Der wahrheitsbegriff in den formalisierten sprachen.Alfred Tarski - 1935 - Studia Philosophica 1:261--405.
String theory.John Corcoran, William Frank & Michael Maloney - 1974 - Journal of Symbolic Logic 39 (4):625-637.
Concatenation as a basis for arithmetic.W. V. Quine - 1946 - Journal of Symbolic Logic 11 (4):105-114.
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-68866f4b87-dxklk uwo