In recent years, several formalisms for program construction have appeared. One such formalism is the type theory developed by Per Martin-L f. Well suited as a theory for program construction, it makes possible the expression of both specifications and programs within the same formalism. Furthermore, the proof rules can be used to derive a correct program from a specification as well as to verify that a given program has a certain property. This book contains a thorough introduction to type theory, (...) with information on polymorphic sets, subsets, monomorphic sets, and a full set of helpful examples. (shrink)

In this book, Zalta attempts to lay the axiomatic foundations of metaphysics by developing and applying a (formal) theory of abstract objects. The cornerstones include a principle which presents precise conditions under which there are abstract objects and a principle which says when apparently distinct such objects are in fact identical. The principles are constructed out of a basic set of primitive notions, which are identified at the end of the Introduction, just before the theorizing begins. The main reason for (...) producing a theory which defines a logical space of abstract objects is that it may have a great deal of explanatory power. It is hoped that the data explained by means of the theory will be of interest to pure and applied metaphysicians, logicians and linguists, and pure and applied epistemologists. (shrink)

Various conceptual approaches to the notion of information can currently be traced in the literature in logic and formal epistemology. A main issue of disagreement is the attribution of truthfulness to informational data, the so called Veridicality Thesis (Floridi 2005). The notion of Epistemic Constructive Information (Primiero 2007) is one of those rejecting VT. The present paper develops a formal framework for ECI. It extends on the basic approach of Artemov’s logic of proofs (Artemov 1994), representing an epistemic logic based (...) on dependent justifications, where the definition of information relies on a strict distinction from factual truth. The definition obtained by comparison with a Normal Modal Logic translates a constructive logic for “becoming informed”: its distinction from the logic of “being informed”—which internalizes truthfulness—is essential to a general evaluation of information with respect to truth. The formal disentanglement of these two logics, and the description of the modal version of the former as a weaker embedding into the latter, allows for a proper understanding of the Veridicality Thesis with respect to epistemic states defined in terms of information. (shrink)

The proofs of universally quantified statements, in mathematics, are given as “schemata” or as “prototypes” which may be applied to each specific instance of the quantified variable. Type Theory allows to turn into a rigorous notion this informal intuition described by many, including Herbrand. In this constructive approach where propositions are types, proofs are viewed as terms of λ-calculus and act as “proof-schemata”, as for universally quantified types. We examine here the critical case of Impredicative Type Theory, i. e. Girard's (...) system F, where type-quantification ranges over all types. Coherence and decidability properties are proved for prototype proofs in this impredicative context. (shrink)

Martin-Löf's constructive type theory forms the basis of this paper. His central notions of category and set, and their relations with Russell's type theories, are discussed. It is shown that addition of an axiom - treating the category of propositions as a set and thereby enabling higher order quantification - leads to inconsistency. This theorem is a variant of Girard's paradox, which is a translation into type theory of Mirimanoff's paradox (concerning the set of all well-founded sets). The occurrence of (...) the contradiction is explained in set theoretical terms. Crucial here is the way a proof-object of an existential proposition is understood. It is shown that also Russell's paradox can be translated into type theory. The type theory extended with the axiom mentioned above contains constructive higher order logic, but even if one only adds constructive second order logic to type theory the contradictions arise. (shrink)

A translation of the Écrits logiques, edited by Jean Van Heijenoort, published in 1968.

The use of “levels of abstraction” in philosophical analysis (levelism) has recently come under attack. In this paper, I argue that a refined version of epistemological levelism should be retained as a fundamental method, called the method of levels of abstraction. After a brief introduction, in section “Some Definitions and Preliminary Examples” the nature and applicability of the epistemological method of levels of abstraction is clarified. In section “A Classic Application of the Method ofion”, the philosophical fruitfulness of the new (...) method is shown by using Kant’s classic discussion of the “antinomies of pure reason” as an example. In section “The Philosophy of the Method of Abstraction”, the method is further specified and supported by distinguishing it from three other forms of “levelism”: (i) levels of organisation; (ii) levels of explanation and (iii) conceptual schemes. In that context, the problems of relativism and antirealism are also briefly addressed. The conclusion discusses some of the work that lies ahead, two potential limitations of the method and some results that have already been obtained by applying the method to some long-standing philosophical problems. (shrink)

Kit Fine’s book is a study of abstraction in a quite precise sense which derives from Frege. In his Grundlagen, Frege contemplates defining the concept of number by means of what has come to be called Hume’s principle—the principle that the number of Fs is the same as the number of Gs just in case there is a one-to-one correspondence between the Fs and the Gs. Frege’s discussion is largely conducted in terms of another, similar but in some respects simpler, (...) proposal—to define the concept of direction by laying down the principle that the direction of a line a is the same as that of line b if and only if lines a and b are parallel. Such principles have come to be known as abstraction principles. More generally, abstraction principles are ones of the shape: ∀α∀β ↔ α ≈ β), where ≈ is an equivalence relation on entities of the type over which α and β vary and, if the principle is acceptable, § is a function from entities of that type to objects. Since ‘the direction of’ is intended to stand for a function from objects of a certain sort to other objects, the Direction Equivalence is a first-order, or in Fine’s terminology objectual, abstraction; since ‘the number of’ is intended to stand for a function from concepts to objects, Hume’s principle is a higher-order, or as Fine says conceptual, abstraction. As is well-known, Frege himself abandoned the idea of defining number implicitly or contextually by means of Hume’s principle—adopting instead an explicit definition of the number of Fs as the extension of the concept concept equinumerous to the concept F— because he thought that an adequate definition should settle the question whether Julius Caesar, for example, is or is not the number of some concept, but that the proposed implicit definition cannot do so. But interest in abstraction principles has revived in the last couple of decades, largely as a result of Crispin Wright’s attempt to show that in spite of the many difficulties confronting it—including the notorious Julius Caesar problem— Hume’s principle can after all serve as a foundation for arithmetic. (shrink)

Kit Fine develops a Fregean theory of abstraction, and suggests that it may yield a new philosophical foundation for mathematics, one that can account for both our reference to various mathematical objects and our knowledge of various mathematical truths. The Limits ofion breaks new ground both technically and philosophically.

We characterize abstraction in computer science by first comparing the fundamental nature of computer science with that of its cousin mathematics. We consider their primary products, use of formalism, and abstraction objectives, and find that the two disciplines are sharply distinguished. Mathematics, being primarily concerned with developing inference structures, has information neglect as its abstraction objective. Computer science, being primarily concerned with developing interaction patterns, has information hiding as its abstraction objective. We show that abstraction through information hiding is a (...) primary factor in computer science progress and success through an examination of the ubiquitous role of information hiding in programming languages, operating systems, network architecture, and design patterns. (shrink)

This study provides a unified theory of properties, relations, and propositions (PRPs). Two conceptions of PRPs have emerged in the history of philosophy. The author explores both of these traditional conceptions and shows how they can be captured by a single theory.

In this volume, John Bacon argues that it is difficult to deny the existence of particularized properties and relations, which in modern philosophy are sometimes called `tropes'. In so doing, he advances a powerful and sophisticated metaphysical theory according to which both ordinary particulars and properties and relations are bundles of tropes.

This volume draws together contributions from researchers whose work builds on the theory developed by Martin-Lof over the last twenty-five years.