I discuss the foundations of predicate ontologies based on two model notions – elementary states of affairs and eventualities, i.e. ordered pairs of initial and end states of affairs. Vendlerian classifications are oriented towards elementary states and tense logic, while Davidsonian classifications deal with eventualities and event logic. There are two kinds of atemporal predicates - fact and properties. Facts are propositional arguments of second-order predicates which add a special meaning that the embedded proposition was verified. Properties are atemporal (...) first-order predicates that lack eventive interpretation and are not associated with factive frames. Davidsonian states are homogeneous durable spatiotemporal things distinct both from atemporal properties and spatiotemporal dynamic predicates. Davidsonian states are causally independent, while resultatives are causally determined as they reconstruct a preceding event that has caused the end state p. I discuss the contrast between external and internal Davidsonian states. The former lack a priority argument and can be quantified extensionally. The latter have a priority experiential argument and can only be quantified intensionally. External states can be observed, while internal states cannot. (shrink)

We introduce a predicative version of topos based on the notion of small maps in algebraic set theory, developed by Joyal and one of the authors. Examples of stratified pseudotoposes can be constructed in Martin-Löf type theory, which is a predicative theory. A stratified pseudotopos admits construction of the internal category of sheaves, which is again a stratified pseudotopos. We also show how to build models of Aczel-Myhill constructive set theory using this categorical structure.

Logicians have often suggested that the use of Euler-type diagrams has influenced the idea of the quantification of the predicate. This is mainly due to the fact that Euler-type diagrams display more information than is required in traditional syllogistics. The paper supports this argument and extends it by a further step: Euler-type diagrams not only illustrate the quantification of the predicate, but also solve problems of traditional proof theory, which prevented an overall quantification of the (...) predicate. Thus, Euler-type diagrams can be called the natural basis of syllogistic reasoning and can even go beyond. In the paper, these arguments are presented in connection with the book Nucleus Logicae Weisaniae by Johann Christian Lange from 1712. (shrink)

A logic-enriched type theory is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named and , which we claim correspond closely to the classical predicative systems of second order arithmetic and . We justify this claim by translating each second order system into the corresponding LTT, and proving that these translations are conservative. This is part of an ongoing research project to investigate how LTTs may be used to formalise (...) different approaches to the foundations of mathematics.The two LTTs we construct are subsystems of the logic-enriched type theory , which is intended to formalise the classical predicative foundation presented by Herman Weyl in his monograph Das Kontinuum. The system has also been claimed to correspond to Weyl’s foundation. By casting and as LTTs, we are able to compare them with . It is a consequence of the work in this paper that is strictly stronger than .The conservativity proof makes use of a novel technique for proving one LTT conservative over another, involving defining an interpretation of the stronger system out of the expressions of the weaker. This technique should be applicable in a wide variety of different cases outside the present work. (shrink)

In an attempt to accommodate natural language phenomena involving nominalization and self-application, various researchers in formal semantics have proposed abandoning the hierarchical type system which Montague inherited from Russell, in favour of more flexible type regimes. We briefly review the main extant proposals, and then develop a new approach, based semantically on Aczel's notion of Frege structure, which implements a version ofsubsumption polymorphism. Nominalization is achieved by virtue of the fact that the types of predicative and propositional complements (...) are contained in the type of individuals. Russell's paradox is avoided by placing a type-constraint on lambda-abstraction, rather than by restricting comprehension. (shrink)

The purpose of this paper is to provide a simple type-free set theory which can be used to give the various readings of collective/distributive sentences.

Predicativity is a notable example of fruitful interaction between philosophy and mathematical logic. It originated at the beginning of the 20th century from methodological and philosophical reflections on a changing concept of set. A clarification of this notion has prompted the development of fundamental new technical instruments, from Russell's type theory to an important chapter in proof theory, which saw the decisive involvement of Kreisel, Feferman and Schütte. The technical outcomes of predica-tivity have since taken a life of their (...) own, but have also produced a deeper understanding of the notion of predicativity, therefore witnessing the " light logic throws on problems in the foundations of mathematics. " (Feferman 1998, p. vii) Predicativity has been at the center of a considerable part of Feferman's work: over the years he has explored alternative ways of explicating and analyzing this notion and has shown that predicative mathematics extends much further than expected within ordinary mathematics. The aim of this note is to outline the principal features of predicativity, from its original motivations at the start of the past century to its logical analysis in the 1950-60's. The hope is to convey why predicativity is a fascinating subject, which has attracted Feferman's attention over the years. (shrink)

Recent studies in semantics of modal and superintuitionistic predicate logics provided many examples of incompleteness, especially for Kripke semantics. So there is a problem: to find an appropriate possible- world semantics which is equivalent to Kripke semantics at the propositional level and which is strong enough to prove general completeness results. The present paper introduces a new semantics of Kripke metaframes' generalizing some earlier notions. The main innovation is in considering "n"-tuples of individuals as abstract "n"-dimensional vectors', together with (...) some transformations of these vectors. Soundness of the semantics is proved to be equivalent to some non- logical properties of metaframes; and thus we describe the maximal semantics of Kripke- type. (shrink)

In this paper we systematically derive a predicate transformer semantics from a direct semantics for a simple probabilistic-nondeterministic programming language . This goal is achieved by exhibiting the direct semantics as isomorphic to a continuation semantics from which the predicate transformer semantics can be read off immediately. This isomorphism allows one to identify nonempty convex compact saturated sets of valuations on the set S of states with certain “good” functionals from to in a way similar to the one (...) how H. Minkowski in 1903 related nonempty convex compact subsets of to what is nowadays called Minkowski functionals. (shrink)

In order to avoid the use of individual variables in predicate calculus, several authors proposed language whose expressions can be interpreted, in general, as denotations of predicates . The present author also proposed a language of this kind [5]. The absence of individual variables makes all these languages rather different from the traditional language of predicate calculus and from the usual language of mathematics. The translation procedures from the ordinary predicate languages into the predicate languages without (...) individual variables and vice versa have a technical character. It is desirable to make possible carrying out such procedures by performing some transformations in a suitable new language which comprises both a sublanguage similar to the ordinary predicate languages and another one not using individual variables. We shall propose now a language of the desired kind. The expressions of this language could be interpreted, in general, as denoting predicates which depend on parameters on a given object domain – this predicate has one argument and depends on one parameter). The proposed language will have the modal features noted in [3] and [5]. It is worthy of mention that the language proposed at the end of [4] although containing expressions interpreted as predicates and expressions with parameters does not allow simultaneous availability of argument places and parameters. (shrink)

This takes a closer look at the actual semantic behavior of apparent truth predicates in English and re-evaluates the way they could motivate particular philosophical views regarding the formal status of 'truth predicates' and their semantics. The paper distinguishes two types of 'truth predicates' and proposes semantic analyses that better reflect the linguistic facts. These analyses match particular independently motivated philosophical views.

Collin Howson (2000) challenges van Cleve’s reliabilist defense of induction (1984) based on an adaptation of Goodman Paradox (or new riddle of induction). I will try to show that Howson’s argument does not succeed once it is self-defeating. Nevertheless, I point out another way which Howson could have employed the new riddle to undermine the reliabilist defense.

Recent debates in metaphysics have highlighted the significance of type theories, such as Simple Type Theory (STT), for our philosophical analysis. In this chapter, I present the salient features of a constructive type theory in the style of Martin-Löf, termed CTT. My principal aim is to convey the flavour of this rich, flexible and sophisticated theory and compare it with STT. I especially focus on the forms of quantification which are available in CTT. A further aim is (...) to argue that a comparison between a plurality of theories is beneficial to the philosophical analysis. We may, for example, discover helpful features of one theory that we may want to import into another context, thus enriching our repertoire of formal tools. Or, through comparison with a less well-known theory, we may gain a better understanding of the characteristics of the theories we are familiar with. As argued in this chapter, CTT has much to offer in all of these respects. (shrink)

The topic of our analysis is the argument for the existence of substances given by Bernard Bolzano in Athanasia, where he essentially employs two ontological categories: substance and adherence. Bolzano considers the real and conditioned Inbegriff of all adherences, which are wirklich and nicht selbst bestehen. He claims that the formed collection is dependent on something external and non-adherential, which therefore is a substance. Bolzano’s argumentation turns out to be structurally similar to his argument for the existence of God from (...) Lehrbuch der Religionswissenschaft, but in each of these reasonings, we find different plausible interpretations of the key concept “Inbegriff”. The latter argumentation refers to the mereological totality of existentially conditioned objects. We propose the explication of the Bolzanian Inbegriff of all adherences using two types of predication: we consider its extension as composed of certain intensional counterparts of adherences. In our approach, we use a fragment of the theory of abstract objects formulated by E. Zalta, describing two different relations between individuals and properties: extensional exemplification and intensional encoding. We put our reconstruction in a wider context of Bolzano’s ontology, formulating the needed axioms with two primitive predicates of second order... is an adherence,... is conditioned by something real as well as the conditionally introduced first order predicate constant \ for Inbegriff of all adherential ideas. Finally, we sketch a model for our theory. (shrink)

In his 2000 book Logical Properties Colin McGinn argues that predicates denote properties rather than sets or individuals. I support the thesis, but show that it is vulnerable to a type-incongruity objection, if properties are (modelled as) functions, unless a device for extensionalizing properties is added. Alternatively, properties may be construed as primitive intensional entities, as in George Bealer. However, I object to Bealer’s construal of predication as a primitive operation inputting two primitive entities and outputting a third primitive (...) entity. Instead I recommend we follow Pavel Tichý in construing both predication and extensionalization as instances of the primitive operation of functional application. (shrink)

Natural languages generally distinguishes among different existence predicates for different types of entities, such as English 'exist', 'occur', and 'obtain'. The paper gives an in-depth discussion and analysis of a range of existence predicates in natural language within the general project of descriptive metaphysics, or more specifically ‘natural language ontology’.

One reason to think that names have a predicate-type semantic value is that they naturally occur in count-noun positions: ‘The Michaels in my building both lost their keys’; ‘I know one incredibly sharp Cecil and one that's incredibly dull’. Predicativism is the view that names uniformly occur as predicates. Predicativism flies in the face of the widely accepted view that names in argument position are referential, whether that be Millian Referentialism, direct-reference theories, or even Fregean Descriptivism. But names (...) are predicates in all of their occurrences; they are predicates that are true of their bearers. When a name appears as a bare singular in argument position, it really occupies the predicate position of what in this essay is called a denuded definite description: a definite description with an unpronounced definite article. Sloat provided good evidence for this. The definite article is sometimes pronounced with names in the singular: ‘The Ivan we all love doesn't feel well’. Sloat proposed a disjunctive generalization of when the definite article must be pronounced with a singular name. This essay shows that by slightly revising Sloat's generalization, we arrive at a simple, nondisjunctive, syntactic rule that governs the overt appearance of the definite article with singular names. But Ivan does not necessarily bear the name ‘Ivan’, so one might worry that the sentence “Ivan might not have had ‘Ivan’ as a name” would incorrectly be predicted false. This essay shows that Predicativism does not have this consequence by showing that incomplete definite descriptions in general and incomplete denuded descriptions, such as ‘Øthe Ivan’, in particular are rigid designators. (shrink)

In this paper I revisit the main arguments for a predicate analysis of descriptions in order to determine whether they do in fact undermine Russell's theory. I argue that while the arguments without doubt provide powerful evidence against Russell's original theory, it is far from clear that they tell against a quantificational account of descriptions.

In this paper, we suggest a strategy for modelling cognitive context within a truth‐conditional semantics, using Asher's model of predication. This allows us to introduce the notion of type presupposition intended as a lexical constraint to the composition of the truth‐conditional content. More specifically, we suggest that this model of predication produces a notion of truth‐conditional meaning where the cognitive context fixes a set of lexical restrictions and forced modifications. We conclude that this model might offer an intermediate position (...) between Minimalism and Contextualism: an account that provides intuitive truth conditions within a formal semantic theory. (shrink)

We investigate a rst-order predicate logic based on Wittgenstein's suggestion to express identity of object by identity of sign, and difference of objects by difference of signs. Hintikka has shown that predicate logic can indeed be set up in such a way; we show that it can be done nicely. More specically, we provide a perspicuous cut-free sequent calculus, as well as a Hilbert-type calculus, for Wittgensteinian predicate logic and prove soundness and completeness theorems.

Prominent constructive theories of sets as Martin-Löf type theory and Aczel and Myhill constructive set theory, feature a distinctive form of constructivity: predicativity. This may be phrased as a constructibility requirement for sets, which ought to be finitely specifiable in terms of some uncontroversial initial “objects” and simple operations over them. Predicativity emerged at the beginning of the 20th century as a fundamental component of an influential analysis of the paradoxes by Poincaré and Russell. According to this analysis the (...) paradoxes are caused by a vicious circularity in definitions; adherence to predicativity was therefore proposed as a systematic method for preventing such problematic circularity. In the following, I sketch the origins of predicativity, review the fundamental contributions by Russell and Weyl and look at modern incarnations of this notion. (shrink)

When, for example, we say of something that it ‘is an object’, or ‘is an event’, or ‘is a property’, we are engaging in categorial predication: we are assigning something to a certain ontological category. Ontologicalcategorization is clearly a type of classification, but it differs radically from the types of classification that are involved in thetaxonomic practices of empirical sciences, as when a physicist saysof a certain particle that it ‘is an electron’, or when a zoologist saysof a certain (...) animal that it ‘is a mammal’, or when a meteorologist says of a certain weather‐phenomenon that it ‘is a hurricane’. Classifications of the latter types presuppose that the items being classified have already been assigned to appropriate ontologicalcategories, such as the categories of object, species, or event. What do categorial predications mean? How are their truth‐conditions to be determined, and how can those truth‐conditions be known to be satisfied? Do they have truthmakers? Questions like these are amongst those addressed in the present paper. (shrink)

In our previous paper [5], we have studied Kripke-type semantics for propositional logics without the contraction rule. In this paper, we will extend our argument to predicate logics without the structure rules. Similarly to the propositional case, we can not carry out Henkin's construction in the predicate case. Besides, there exists a difficulty that the rules of inference () and () are not always valid in our semantics. So, we have to introduce a notion of normal models.

A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including donkey sentences and cross-sentential anaphora. A proof system in natural deduction format is provided, and the formalism is compared with other accounts of this type of anaphora, in particular Dynamic Predicate Logic.

We develop a predicate logical extension of a subintuitionistic propositional logic. Therefore a Hilbert type calculus and a Kripke type model are given. The propositional logic is formulated to axiomatize the idea of strategic weakening of Kripke''s semantic for intuitionistic logic: dropping the semantical condition of heredity or persistence leads to a nonmonotonic model. On the syntactic side this leads to a certain restriction imposed on the deduction theorem. By means of a Henkin argument strong completeness is (...) proved making use of predicate logical principles, which are only classically acceptable. (shrink)

When, for example, we say of something that it ‘is an object’, or ‘is an event’, or ‘is a property’, we are engaging in categorial predication: we are assigning something to a certain ontological category. Ontological categorization is clearly a type of classification, but it differs radically from the types of classification that are involved in the taxonomic practices of empirical sciences, as when a physicist says of a certain particle that it ‘is an electron’, or when a zoologist (...) says of a certain animal that it ‘is a mammal’, or when a meteorologist says of a certain weather‐phenomenon that it ‘is a hurricane’. Classifications of the latter types presuppose that the items being classified have already been assigned to appropriate ontological categories, such as the categories of object, species, or event. What do categorial predications mean? How are their truth‐conditions to be determined, and how can those truth‐conditions be known to be satisfied? Do they have truthmakers? Questions like these are amongst those addressed in the present paper. (shrink)

Predicate modal formulas with non-modalized quantifiers (call them Q-formulas) are considered as schemata of arithmetical formulas, where is interpreted as the provability predicate of some fixed correct extension T of arithmetic. A method of constructing 1) non-provable in T and 2) false arithmetical examples for Q-formulas by Kripke-like countermodels of certain type is given. Assuming the means of T to be strong enough to solve the (undecidable) problem of derivability in QGL, the Q-fragment of the predicate (...) version of the logic GL, we prove the recursive enumerability of the sets of Q-formulas all arithmetical examples of which are: 1) T-provable, 2) true. In. particular, the first one is shown to be exactly QGL and the second one to be exactly the Q-fragment of the predicate version of Solovay's logic S. (shrink)

In truth theory one aims at general formal laws governing the attribution of truth to statements. Gupta’s and Belnap’s revision-theoretic approach provides various well-motivated theories of truth, in particular T* and T#, which tame the Liar and related paradoxes without a Tarskian hierarchy of languages. In property theory, one similarly aims at general formal laws governing the predication of properties. To avoid Russell’s paradox in this area a recourse to type theory is still popular, as testified by recent work (...) in formal metaphysics by Williamson and Hale. There is a contingent Liar that has been taken to be a problem for type theory. But this is because this Liar has been presented without an explicit recourse to a truth predicate. Thus, type theory could avoid this paradox by incorporating such a predicate and accepting an appropriate theory of truth. There is however a contingent paradox of predication that more clearly undermines the viability of type theory. It is then suggested that a type-free property theory is a better option. One can pursue it, by generalizing the revision-theoretic approach to predication, as it has been done by Orilia with his system P*, based on T*. Although Gupta and Belnap do not explicitly declare a preference for T# over T*, they show that the latter has some advantages, such as the recovery of intuitively acceptable principles concerning truth and a better reconstruction of informal arguments involving this notion. A type-free system based on T# rather than T* extends these advantages to predication and thus fares better than P* in the intended applications of property theory. (shrink)

Shehtman and Skvortsov introduced Kripke bundles as semantics of non-classical first-order predicate logics. We show the structural equivalence between Kripke bundles for intermediate predicate lógics and Kripke-type frames for intuitionistic modal propositional logics. This equivalence enables us to develop the semantical study of relations between intermediate predicate logics and intuitionistic modal propositional logics. New examples of modal counterparts of intermediate predicate logics are given.

In this paper, we examine a fundamental problem that appears in Greek philosophy: the paradoxes of self-reference of the type of “Third Man” that appears first in Plato’s 'Parmenides', and is further discussed in Aristotle and the Peripatetic commentators and Proclus. We show that the various versions are analysed using different language, reflecting different understandings by Plato and the Platonists, such as Proclus, on the one hand, and the Peripatetics (Aristotle, Alexander, Eudemus), on the other hand. We show that (...) the Peripatetic commentators do not focus on Plato’s solution but primarily on the formulation of the “Third Man” paradox. On the contrary, Proclus seems to be convinced that Plato suggests a sound solution to the paradox by defining the predicate of similarity (homogeneity) that demarcates two types of homogeneous entities – the eide and the participants in them in a way that their confusion would be inadmissible. We claim that Plato’s solution follows a sound line of reasoning that is formalisable in a language of Frege-Russell type; hence there exists a model in which Plato’s reasoning is valid. Furthermore, we notice that Plato’s definition of the second-order predicate of similarity is attained by resorting to first-order entities. In this sense, Plato’s definition is comparable to Eudoxus’ definition of ratio, which is also attained by resorting to first-order objects. Consequently, Plato seems to follow a logical practice established by the mathematicians of the 5th century, notably Eudoxus, in his solution to the paradox. (shrink)

The orthodox view of proper names, Millianism, provides a very simple and elegant explanation of the semantic contribution of referential uses of names–names that occur as bare singulars and as the argument of a predicate. However, one problem for Millianism is that it cannot explain the semantic contribution of predicative uses of names. In recent years, an alternative view, so-called the-predicativism, has become increasingly popular. According to the-predicativists, names are uniformly count nouns. This straightforwardly explains why names can be (...) used predicatively, but is prima facie less congenial to an analysis of referential uses. To address this issue, the-predicativists argue that referential names are in fact complex determiner phrases consisting of a covert definite determiner and a count noun—and so, a referential name is a definite description. In this paper, I will argue that despite the appearance of increased theoretical complexity, the view that names are ambiguous between predicative and referential types is in fact superior to the unitary the-predicativist view. However, I will also argue that to see why this ambiguity view is better, we need to give up the standard Millian analysis. Consequently, I will first propose an alternative analysis of referential names that retains the virtues of Millianism, but provides an important explanatory connection to the predicative uses. Once this analysis of names is adopted, the explanation for why names are systematically ambiguous between referential and predicative types is both simple and elegant. Second, I will argue that the-predicativism has the appearance of being simpler than an ambiguity view, but is in fact unable to account for certain key properties of referential names without making ad hoc stipulations. (shrink)

We study a predicate extension of an unbounded real valued propositional logic that has been recently introduced. The latter, in turn, can be regarded as an extension of both the abelian logic and of the propositional continuous logic. Among other results, we prove that our predicate extension satisfies the property of weak completeness (the equivalence between satisfiability and consistency) and, under an additional assumption on the set of premisses, the property of strong completeness (the equivalence between logical consequence (...) and provability). Eventually we discuss some topological properties of the space of types in our logic. (shrink)

We formulate a Curry-typed logic with fine-grained intensionality within Turner’s typed predicate logic. This allows for an elegant presentation of a theory that corresponds to Fox and Lappin’s property theory with curry typing, but without the need for a federation of languages. We then consider how the fine-grained intensionality of this theory can be given an operational interpretation. This interpretation suggests itself as expressions in the theory can be viewed as terms in the untyped lambda-calculus, which provides a model (...) of computation. (shrink)

In 1958 Gödel published his Dialectica interpretation, which reduces classical arithmetic to a quantifier-free theory T axiomatizing the primitive recursive functionals of finite type. Here we extend Gödel's T to theories Pn of “predicative” functionals, which are defined using Martin-Löf's universes of transfinite types. We then extend Gödel's interpretation to the theories of arithmetic inductive definitions IDn, so that each IDn is interpreted in the corresponding Pn. Since the strengths of the theories IDn are cofinal in the ordinal Γ0, (...) as a corollary this analysis provides an ordinal-free characterization of the <Γ0-recursive functions. (shrink)

Sortal predicates have been associated with a counting process, which acts as a criterion of identity for the individuals they correctly apply to. We discuss in what sense certain types of predicates suggested by quantum physics deserve the title of ‘sortal’ as well, although they do not characterize either a process of counting or a criterion of identity for the entities that fall under them. We call such predicates ‘quantum-sortal predicates’ and, instead of a process of counting, to them is (...) associated a ‘criterion of cardinality’. After their general characterization, it is discussed how these predicates can be formally described. (shrink)

Tangled Type Theory was introduced by Randall Holmes in [3] as a new way of approaching the consistency problem for$\mathrm {NF}$. Although the task of finding models for this theory is far from trivial (considering it is equiconsistent with$\mathrm {NF}$), ways of constructing models for certain fragments of it have been discovered. In this article, we present a simpler way of constructing models of predicative Tangled Type Theory and consequently of predicative$\mathrm {NF}$. In these new models of predicative$\mathrm (...) {NF}$, the universe is well-orderable and equinumerous to the set of singletons. (shrink)