2003
DOI: 10.1016/s0168-0072(02)00040-4
|View full text |Cite
|
Sign up to set email alerts
|

Universes over Frege structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(10 citation statements)
references
References 30 publications
0
10
0
Order By: Relevance
“…This idea of Kahle's is based on the notion of so-called Frege structures, and he has published a series of papers on theories of Frege structures over applicative base theories (Kahle 1999(Kahle , 2001(Kahle , 2003(Kahle , 2009(Kahle , 2011. This idea of Kahle's is based on the notion of so-called Frege structures, and he has published a series of papers on theories of Frege structures over applicative base theories (Kahle 1999(Kahle , 2001(Kahle , 2003(Kahle , 2009(Kahle , 2011.…”
Section: "Sets Truth and Recursion" By Reinhard Kahlementioning
confidence: 99%
See 1 more Smart Citation
“…This idea of Kahle's is based on the notion of so-called Frege structures, and he has published a series of papers on theories of Frege structures over applicative base theories (Kahle 1999(Kahle , 2001(Kahle , 2003(Kahle , 2009(Kahle , 2011. This idea of Kahle's is based on the notion of so-called Frege structures, and he has published a series of papers on theories of Frege structures over applicative base theories (Kahle 1999(Kahle , 2001(Kahle , 2003(Kahle , 2009(Kahle , 2011.…”
Section: "Sets Truth and Recursion" By Reinhard Kahlementioning
confidence: 99%
“…This was investigated by using an external levelling and by Kahle (2003) with an internal levelling. Iterating truth.…”
Section: Strengtheningsmentioning
confidence: 99%
“…Given a system S, Ax$ represents the set of the axioms of S and Prvs is a canonical provability predicate of S. Let P L^ be pure classical predicate logic for the language S?^ (thus with equality); then Axpi_^ represents the set of logical axioms (for S?^). Our following formulation of VF_< is based on the simpler version of VF in [5] (or [14]) rather than the original one in [4], DEFINITION 36. Given a p.r.…”
Section: Corollary26mentioning
confidence: 99%
“…Lower bound. Kahle [14] gave a syntactical embedding of IDi in VF. In the present subsection, we generalize it to an embedding of ID_< in VF^.…”
Section: Corollary26mentioning
confidence: 99%
See 1 more Smart Citation