Results 1 
4 of
4
Classical And Constructive Hierarchies In Extended Intuitionistic Analysis
"... This paper introduces an extension of Kleene's axiomatization of Brouwer's intuitionistic analysis, in which the classical arithmetical and analytical hierarchies are faithfully represented as hierarchies of the domains of continuity. A domain of continuity is a relation R(#) on Baire sp ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
This paper introduces an extension of Kleene's axiomatization of Brouwer's intuitionistic analysis, in which the classical arithmetical and analytical hierarchies are faithfully represented as hierarchies of the domains of continuity. A domain of continuity is a relation R(#) on Baire space with the property that every constructive partial functional defined on {# : R(#)} is continuous there. The domains of continuity for coincide with the stable relations (those equivalent in to their double negations), while every relation R(#) is equivalent in #) for some stable A(#, #) (which belongs to the classical analytical hierarchy). The logic of is intuitionistic. The axioms of include countable comprehension, bar induction, Troelstra's generalized continuous choice, primitive recursive Markov's Principle and a classical axiom of dependent choices proposed by Krauss. Constructive dependent choices, and constructive and classical countable choice, are theorems.
Operations on Proofs That Can Be Specified By Means of Modal Logic
"... Explicit modal logic was first sketched by Gödel in [16] as the logic with the atoms "t is a proof of F". The complete axiomatization of the Logic of Proofs LP was found in [4] (see also [6],[7],[18]). In this paper we establish a sort of a functional completeness property of proof polynom ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Explicit modal logic was first sketched by Gödel in [16] as the logic with the atoms "t is a proof of F". The complete axiomatization of the Logic of Proofs LP was found in [4] (see also [6],[7],[18]). In this paper we establish a sort of a functional completeness property of proof polynomials which constitute the system of proof terms in LP. Proof polynomials are built from variables and constants by three operations on proofs: "\Delta" (application), "!" (proof checker), and "+" (choice). Here constants stand for canonical proofs of "simple facts", namely instances of propositional axioms and axioms of LP in a given proof system. We show that every operation on proofs that (i) can be specified in a propositional modal language and (ii) is invariant with respect to the choice of a proof system is realized by a proof polynomial.
3. REPORT TYPE AND DATES COVERED jec HNicfli. 4. TITLE AND SUBTITLE EXPLICIT PROBABILITY: THE INTENDED SEMANTICS FOR INTUITIONISTIC AND MODAL LOGIC
, 1999
"... enter for oundations of ..."
(Show Context)