- 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
Some Observations on the FGH Theorem
Studia Logica 111 (5):749-778 (2023)
Abstract
We investigate the Friedman–Goldfarb–Harrington theorem from two perspectives. Firstly, in the frameworks of classical and modal propositional logics, we study the forms of sentences whose existence is guaranteed by the FGH theorem. Secondly, we prove some variations of the FGH theorem with respect to Rosser provability predicates.Other Versions
No versions found
My notes
Similar books and articles
Arithmetical Completeness Theorem for Modal Logic $$mathsf{}$$.Taishi Kurahashi - 2018 - Studia Logica 106 (2):219-235.
Hennessy-Milner and Van Benthem for Instantial Neighbourhood Logic.Jim de Groot - 2022 - Studia Logica 110 (3):717-743.
Birkhoff’s and Mal’cev’s Theorems for Implicational Tonoid Logics.Eunsuk Yang - 2023 - Studia Logica 111 (3):501-519.
Game logic and its applications II.Mamoru Kaneko & Takashi Nagashima - 1997 - Studia Logica 58 (2):273-303.
Glivenko type theorems for intuitionistic modal logics.Guram Bezhanishvili - 2001 - Studia Logica 67 (1):89-109.
An Institution-Independent Proof of the Robinson Consistency Theorem.Daniel Gâinâ & Andrei Popescu - 2007 - Studia Logica 85 (1):41-73.
Analytics
Added to PP
2023-04-28
Downloads
18 (#1,115,326)
6 months
5 (#1,047,105)
2023-04-28
Downloads
18 (#1,115,326)
6 months
5 (#1,047,105)
Historical graph of downloads
References found in this work
The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic.Albert Visser - 1984 - Journal of Philosophical Logic 13 (1):97 - 113.
Henkin sentences and local reflection principles for Rosser provability.Taishi Kurahashi - 2016 - Annals of Pure and Applied Logic 167 (2):73-94.
Fifty years of self-reference in arithmetic.C. Smoryński - 1981 - Notre Dame Journal of Formal Logic 22 (4):357-374.
Representability of recursively enumerable sets in formal theories.J. C. Shepherdson - 1961 - Archive for Mathematical Logic 5 (3-4):119-127.
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-648784bb4d-72rpk uwo