Results 1  10
of
26
ECC, an Extended Calculus of Constructions
, 1989
"... We present a higherorder calculus ECC which can be seen as an extension of the calculus of constructions [CH88] by adding strong sum types and a fully cumulative type hierarchy. ECC turns out to be rather expressive so that mathematical theories can be abstractly described and abstract mathematics ..."
Abstract

Cited by 85 (4 self)
 Add to MetaCart
We present a higherorder calculus ECC which can be seen as an extension of the calculus of constructions [CH88] by adding strong sum types and a fully cumulative type hierarchy. ECC turns out to be rather expressive so that mathematical theories can be abstractly described and abstract mathematics may be adequately formalized. It is shown that ECC is strongly normalizing and has other nice prooftheoretic properties. An !\GammaSet (realizability) model is described to show how the essential properties of the calculus can be captured settheoretically.
Higher Order Logic
 In Handbook of Logic in Artificial Intelligence and Logic Programming
, 1994
"... Contents 1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 2 The expressive power of second order Logic : : : : : : : : : : : 3 2.1 The language of second order logic : : : : : : : : : : : : : 3 2.2 Expressing size : : : : : : : : : : : : : : : : : : : : : : : : 4 2.3 Definin ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
Contents 1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 2 The expressive power of second order Logic : : : : : : : : : : : 3 2.1 The language of second order logic : : : : : : : : : : : : : 3 2.2 Expressing size : : : : : : : : : : : : : : : : : : : : : : : : 4 2.3 Defining data types : : : : : : : : : : : : : : : : : : : : : 6 2.4 Describing processes : : : : : : : : : : : : : : : : : : : : : 8 2.5 Expressing convergence using second order validity : : : : : : : : : : : : : : : : : : : : : : : : : 9 2.6 Truth definitions: the analytical hierarchy : : : : : : : : 10 2.7 Inductive definitions : : : : : : : : : : : : : : : : : : : : : 13 3 Canonical semantics of higher order logic : : : : : : : : : : : : 15 3.1 Tarskian semantics of second order logic : : : : : : : : : 15 3.2 Function and re
Constructive set theories and their categorytheoretic models
 IN: FROM SETS AND TYPES TO TOPOLOGY AND ANALYSIS
, 2005
"... We advocate a pragmatic approach to constructive set theory, using axioms based solely on settheoretic principles that are directly relevant to (constructive) mathematical practice. Following this approach, we present theories ranging in power from weaker predicative theories to stronger impredicat ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We advocate a pragmatic approach to constructive set theory, using axioms based solely on settheoretic principles that are directly relevant to (constructive) mathematical practice. Following this approach, we present theories ranging in power from weaker predicative theories to stronger impredicative ones. The theories we consider all have sound and complete classes of categorytheoretic models, obtained by axiomatizing the structure of an ambient category of classes together with its subcategory of sets. In certain special cases, the categories of sets have independent characterizations in familiar categorytheoretic terms, and one thereby obtains a rich source of naturally occurring mathematical models for (both predicative and impredicative) constructive set theories.
Constructive Mathematics, in Theory and Programming Practice
, 1997
"... The first part of the paper introduces the varieties of modern constructive mathematics, concentrating on Bishop's constructive mathematics (BISH). It gives a sketch of both Myhill's axiomatic system for BISH and a constructive axiomatic development of the real line R. The second part ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
The first part of the paper introduces the varieties of modern constructive mathematics, concentrating on Bishop's constructive mathematics (BISH). It gives a sketch of both Myhill's axiomatic system for BISH and a constructive axiomatic development of the real line R. The second part of the paper focusses on the relation between constructive mathematics and programming, with emphasis on MartinLof's theory of types as a formal system for BISH.
Relating firstorder set theories and elementary toposes
 BULLETIN OF SYMBOLIC LOGIC
, 2007
"... We show how to interpret the language of firstorder set theory in an elementary topos endowed with, as extra structure, a directed structural system of inclusions (dssi). As our main result, we obtain a complete axiomatization of the intuitionistic set theory validated by all such interpretations. ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We show how to interpret the language of firstorder set theory in an elementary topos endowed with, as extra structure, a directed structural system of inclusions (dssi). As our main result, we obtain a complete axiomatization of the intuitionistic set theory validated by all such interpretations. Since every elementary topos is equivalent to one carrying a dssi, we thus obtain a firstorder set theory whose associated categories of sets are exactly the elementary toposes. In addition, we show that the full axiom of Separation is validated whenever the dssi is superdirected. This gives a uniform explanation for the known facts that cocomplete and realizability toposes provide models for Intuitionistic ZermeloFraenkel set theory (IZF).
Choice principles in constructive and classical set theories
 POHLERS (EDS.): PROCEEDINGS OF THE LOGIC COLLOQUIUM 2002
, 2002
"... The objective of this paper is to assay several forms of the axiom of choice that have been deemed constructive. In addition to their deductive relationships, the paper will be concerned with metamathematical properties effected by these choice principles and also with some of their classical models ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
The objective of this paper is to assay several forms of the axiom of choice that have been deemed constructive. In addition to their deductive relationships, the paper will be concerned with metamathematical properties effected by these choice principles and also with some of their classical models.
Relating firstorder set theories, toposes and categories of classes
 In preparation
, 2006
"... This paper introduces Basic Intuitionistic Set Theory BIST, and investigates it as a firstorder settheory extending the internal logic of elementary toposes. Given an elementary topos, together with the extra structure of a directed structural system of inclusions (dssi) on the topos, a forcingst ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
This paper introduces Basic Intuitionistic Set Theory BIST, and investigates it as a firstorder settheory extending the internal logic of elementary toposes. Given an elementary topos, together with the extra structure of a directed structural system of inclusions (dssi) on the topos, a forcingstyle interpretation of the language of firstorder set theory in the topos is given, which conservatively extends the internal logic of the topos. Since every topos is equivalent to one carrying a dssi, the language of firstorder has a forcing interpretation in every elementary topos. We prove that the set theory BIST+ Coll (where Coll is the strong Collection axiom) is sound and complete relative to forcing interpretations in toposes with natural numbers object (nno). Furthermore, in the case that the structural system of inclusions is superdirected, the full Separation schema is modelled. We show that every cocomplete topos and every realizability topos can be endowed (up to equivalence) with such a superdirected structural system of inclusions. This provides a uniform explanation for why such “realworld ” toposes model Separation. A large part of the paper is devoted to an alternative notion of categorytheoretic model for BIST, which, following the general approach of Joyal and Moerdijk’s Algebraic Set Theory, axiomatizes the structure possessed by categories of classes compatible with ∗Corresponding author. 1Previously, lecturer at HeriotWatt University (2000–2001), and the IT University of
Relationships between constructive, predicative, and classical systems of analysis
 In Hendricks et al
"... Both the constructive and predicative approaches to mathematics arose during the period of what was felt to be a foundational crisis in the early part of this century. Each critiqued an essential logical aspect of classical mathematics, namely concerning the unrestricted use of the law of excluded ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Both the constructive and predicative approaches to mathematics arose during the period of what was felt to be a foundational crisis in the early part of this century. Each critiqued an essential logical aspect of classical mathematics, namely concerning the unrestricted use of the law of excluded middle on the one hand, and of apparently circular \impredicative &quot; de nitions on the other. But the positive redevelopment of mathematics along constructive, resp. predicative grounds did not emerge as really viable alternatives to classical, settheoretically based mathematics until the 1960s. Now wehave a massive amount of information, to which this lecture will constitute an introduction, about what can be done by what means, and about the theoretical interrelationships between various formal systems for constructive, predicative and classical analysis. In this nal lecture I will be sketching some redevelopments of classical analysis on both constructive and predicative grounds, with an emphasis on modern approaches. In the case of constructivity, Ihave very little to say about Brouwerian intuitionism, which has been discussed extensively in other lectures at this conference, and concentrate instead on the approach since 1967 of Errett Bishop and his school. In the case of predicativity, I concentrate on developmentsalso since the 1960swhich take up where Weyl's work left o, as described in my second lecture. In both cases, I rst look at these redevelopments from a more informal, mathematical, point This is the last of my three lectures for the conference, Proof Theory: History and
Elementary constructive operational set theory. To appear in: Festschrift for Wolfram Pohlers, Ontos Verlag
"... Abstract. We introduce an operational set theory in the style of [5] and [17]. The theory we develop here is a theory of constructive sets and operations. One motivation behind constructive operational set theory is to merge a constructive notion of set ([1], [2]) with some aspects which are typical ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We introduce an operational set theory in the style of [5] and [17]. The theory we develop here is a theory of constructive sets and operations. One motivation behind constructive operational set theory is to merge a constructive notion of set ([1], [2]) with some aspects which are typical of explicit mathematics [14]. In particular, one has nonextensional operations (or rules) alongside extensional constructive sets. Operations are in general partial and a limited form of self–application is permitted. The system we introduce here is a fully explicit, finitely axiomatised system of constructive sets and operations, which is shown to be as strong as HA. 1.