A notion of strictly primitive recursive realizability is introduced by Damnjanovic in 1994. It is a kind of constructive semantics of the arithmetical sentences using primitive recursive functions. It is of interest to study the corresponding predicate logic. It was argued by Park in 2003 that the predicate logic of strictly primitive recursive realizability is not arithmetical. Park’s argument is essentially based on a claim of Damnjanovic that intuitionistic logic is sound with respect to strictly (...) primitive recursive realizability, but that claim was disproved by the author of this article in 2006. The aim of this paper is to present a correct proof of the result of Park. (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)

Platonism, in its most recent and seemingly most cogent form, has rested on (a) the supposed indispensability of descriptive predicate terms in so-called "improved," or "clarified," or "perspicuous" languages; (b) the distinction between subject and predicate terms based on the asymmetry of the predication relation; and (c) the claimed ontological significance of the different categories of terms implied by (a) and (b). Nominalism, in one of its most pervasive recent forms, has involved the denial of the criterion of (...) ontological commitment embedded in (c) by explicitly or implicitly adopting the criterion expressed in Quine's formula "to be is to be the value of a variable." To avoid the obvious charge that nominalists merely ignore abstract entities by the arbitrary ploy of changing the rules, i.e. denying that ontological commitments are made by the inclusion of primitive predicates in schemata of certain kinds by simply employing a different criterion of commitment, some nominalists have sought to argue for their criterion by pointing to the distinction between singular and general terms and the radically different roles such terms play. The distinction between singular and general terms becomes the premise for an argument that purportedly supports Quine's criterion of ontological commitment. This criterion, in turn, provides the basis for the nomin'alist's use of primitive predicates, as general terms, without ontological commitment to abstract entities. In this paper I shall argue that the nominalist's gambit is inadequate in that the distinction between singular and general terms, as employed by a philosopher like Quine, merely provides a way of stating the nominalist's position and does not provide a reason for holding such a position. To put it another way, if we consider the contemporary nominalist to argue from the distinction between singular and general terms to the cogency of nominalism, since the former provides a ground for Quine's criterion of ontological commitment which, in turn, provides the basis for the latter, then the line of thought is question begging. It is so in that the very way the nominalist draws the distinction presupposes a nominalistic view, since a careful statement of that distinction amounts to a restatement of the nominalistic position. (shrink)

Kant’s precritical possibility proof for the existence of God is often thought to have Spinozistic implications. One important reason for this is that Kant’s reasoning in the Beweisgrund appears to entail that God is extended or spatial. Kant argues that God exemplifies all primitive predicates. Since he also treats extension as such a primitive predicate, it seems to straightforwardly follow that God is extended. This paper argues that Kant’s argument in the Beweisgrund does not, in fact, lead (...) to this Spinozistic conclusion. Importantly, Kant distinguishes between concepts that are primitive for us and concepts that are primitive in themselves. This distinction equips Kant with the resources to block the Spinozistic conclusion that God is extended: he can accept that extension is a primitive concept for us and at the same time reject that extension is a concept primitive in itself, and thus exemplified by God. (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)

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)

Although Peano arithmetic is necessarily incomplete, Isaacson argued that it is in a sense conceptually complete: proving a statement of the language of PA that is independent of PA will require conceptual resources beyond those needed to understand PA. This paper gives a test of Isaacon’s thesis. Understanding PA requires understanding the functions of addition and multiplication. It is argued that grasping these primitive recursive functions involves grasping the double ancestral, a generalized version of the ancestral operator. Thus, we (...) can test Isaacon’s thesis by seeing whether when we phrase arithmetic in a context with the double ancestral operator, the result is conservative over PA. This is a stronger version of the test given by Smith, who argued that understanding the predicate “natural number” requires understanding the ancestral operator, but did not investigate what is required to understand the arithmetic functions. (shrink)

In this dissertation I defend the claim, long held by Donald Davidson, that truth is a primitive concept that cannot be correctly or informatively defined in terms of more basic concepts. To this end I articulate the history of the primitive thesis in the 20th century, working through early Moore, Russell, and Frege, and provide improved interpretations of their reasons for advancing and eventually abandoning the primitive thesis. I show the importance of slingshot-style arguments in the work (...) of Frege, Church, Davidson, and Gödel for resisting certain versions of the correspondence theory of truth. I argue that most slingshots fail to convincingly establish a collapsing conclusion, but that a Gödelian version of the slingshot is terminal to certain varieties of the correspondence theory of truth. I then provide a Davidsonian theory of truth and interpretation that is consistent with and makes use of the primitive thesis. Finally, I provide an account of predication, properties, and universals that I argue is both serviceable and consistent with Davidson’s overall program. (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)

Robert cummins has recently attacked this line of argument: if p is a semantically primitive predicate of a first order language l, then p requires its own clause in the definition of satisfaction integral to a definition of truth of l. thus if l has infinitely many such p, the satisfaction clause cannot be completed and truth for l will remain undefined. against this cummins argues that a single clause in a general base theory for l can specify (...) satisfaction conditions for even infinitely many semantically primitive predicates of l. against cummins we argue that a general base theory contains a primitive expression 'applies to' and that to make his case cummins would need to prove this expression stands for a semantical relation sufficient to a truth definition for l. not only is such a proof lacking but we show the claim to be altogether dubious. (shrink)

The core language can be extended by defining additional logical constants. E.g., we can add ‘→’ (implication), ‘∨’ (disjunction), and ‘∀x’ (universal quantifiers). The choice of logical primitives is not as optional in DPL as it is in standard predicate logic.

A natural approach to representing and reasoning about temporal propositions (i.e., statements with time-dependent truth-values) is to associate them with time elements. In the literature, there are three choices regarding the primitive for the ontology of time: (1) instantaneous points, (2) durative intervals and (3) both points and intervals. Problems may arise when one conflates different views of temporal structure and questions whether some certain types of temporal propositions can be validly and meaningfully associated with different time elements. In (...) this paper, we shall summarize an ontological glossary with respect to time elements, and diversify a wider range of meta-predicates for ascribing temporal propositions to time elements. Based on these, we shall also devise a versatile categorization of temporal propositions, which can subsume those representative categories proposed in the literature, including that of Vendler, of McDermott, of Allen, of Shoham, of Galton and of Terenziani and Torasso. It is demonstrated that the new categorization of propositions, together with the proposed range of meta-predicates, provides the expressive power for modeling some typical temporal terms/phenomena, such as starting-instant, stopping-instant, dividing-instant, instigation, termination and intermingling etc. (shrink)

The problems of logical translation of axiomatizations and the choice of primitive operators have surfaced several times over the years. An early issue was raised by H. Hiz∙ in the 1950s on the incompleteness of translated calculi. Further pertinent work, some of it touched on here, was done in the 1970s by W. Frank and S. Shapiro, as well as by others in subsequent decades. As we shall see, overlooking such possibilities has led to incorrect claims of completeness being (...) made (e.g. by J. L. Bell and A. B. Slomson as well as J. N. Crossley) for axiomatizations of classical predicate logic obtained by translation from axiomatizations suited to differently chosen logical primitives. In this note we begin by discussing some problematic aspects of an early article by W. Frank on the difficulties of obtaining completeness theorems for translated calculi. Shapiro had established the incompleteness of Crossley’s axiomatization by exhibiting a propositional tautology that was not provable. In contrast, to deal with Bell and Slomson’s system which is complete for propositional tautologies, we go on to show that taking a formal system for classical predicate calculus with the primitive ∃, setting ∀xφ(x) =def ¬∃x¬φ(x), and writing down a set of axioms and rules complete for the calculus with ∀ instead of ∃ as primitive, does not guarantee completeness of the resulting system. In particular, instances of the valid schema ∃xφ(x) → ∃x¬¬φ(x) are not provable, which is analogous to what occurs in modal logic with □ and ⋄. © 2023 Elsevier B.V., All rights reserved. (shrink)

There are two crucial problems for those who would take existence to be a ‘real’ property. (1) The predication of such a property of a thing appears insufficient to distinguish cases where the thing exists, on the one hand, from those where it does not exist on the other. That is, the property of existence does not add anythingto the concept of a thing. (2) If non-existent things are capable of having properties and identity – which is necessary to avoid (...) an objection made by A. J. Ayer – then the identity of all things with all other things appears to follow. However, if the concept of existence is explained as a primitive property manifest as resistance toontological contradiction then these problems can be solved. The pay-off for considering existence to be a first-order predicate is, therefore, an argument against existing ontological contradictions. (shrink)

The subject of this rich and wide-ranging book is old-fashioned metaphysics: its aim is to give an account of "the real constituents of the world". But its idiom and methodology are those of late twentieth-century analytic philosophy. Newman works out his own positions in constant dialogue with such philosophers as Frege and Wittgenstein, Geach and D. M. Armstrong, Keith Campbell and David Lewis; and he has an impressive mastery of modern formal logic and contemporary philosophy of language. He also makes (...) effective use of a quite detailed understanding of recent work in mathematics and physics. For all his reliance on the concepts and techniques of logic and philosophy of language, however, Newman does not believe that either language or logic "is a reliable guide to the nature of reality". On his view, metaphysics is an autonomous intellectual discipline, at least some of whose convictions and concepts are primitive. (shrink)

We estimate the derivation lengths of functionals in Gödel's system \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document} of primitive recursive functionals of finite type by a purely recursion-theoretic analysis of Schütte's 1977 exposition of Howard's weak normalization proof for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document}. By using collapsing techniques from Pohlers' local predicativity approach to proof theory and based on the Buchholz-Cichon and Weiermann 1994 approach to subrecursive hierarchies we define (...) a collapsing f unction\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\cal D}:T\to \omega$\end{document} so that for (closed) terms \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $a,b$\end{document} of Gödel's \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document} we have: If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $a$\end{document} reduces to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $b$\end{document} then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\omega>{\cal D}(a)>{\cal D}(b).$\end{document} By one uniform proof we obtain as corollaries: A derivation lengths classification for functionals in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document}, hence new proof of strongly uniform termination of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document}. A new proof of the Kreisel's classific ation of the number-theoretic functions which can be defined in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document}, hence a classification of the provably total functions of Peano Arithmetic. A new proof of Tait's results on weak normalization for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document}. A new proof of Troelstra's result on strong normalization for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document}. Additionally, a slow growing analysis of Gödel's \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document} is obtained via Girard's hierarchy comparison theorem. This analyis yields a contribution to two open pro blems posed by Girard in part two of his book on proof theory. For the sake of completeness we also mention the Howard Schütte bound on derivation lengths for the simple typed \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\lambda$\end{document}-calculus. (shrink)

We often predicate capacities of substances in such a way so as to modify the way that they exist . However, sometimes a capacity is not for the modification of a substance but for the existence of one. Moreover, we have reason to think that these capacities are just as real as other capacities. If that’s right, then the question arises: if these capacities are real features in the world, what they are real features of? Part I argues that (...) they can’t be capacities of substances, and so they must be capacities of some part of substances. Part II argues that they can’t be capacities of the substance’s integral/substantial parts. Part III argues that a possessor of such capacities would have to be a lot like prime matter in not being characterized by substantial forms. (shrink)

In the context of Hurford's claim that “some feature of language structure maps onto a feature of primitive mental representations,” I will argue that Hurford's focus on 1-place predicates as the basis of the “mental representations of situations in the world” is problematic, particularly with respect to spatiotemporal events. A solution is proposed.

In 1985, van den Dries showed that the theory of the reals with a predicate for the integer powers of two admits quantifier elimination in an expanded language, and is hence decidable. He gave a model-theoretical argument, which provides no apparent bounds on the complexity of a decision procedure. We provide a syntactical argument that yields a procedure that is primitive recursive, although not elementary.

Recently, Feferman and Hellman (and Aczel) showed how to establish the existence and categoricity of a natural number system by predicative means given the primitive notion of a finite set of individuals and given also a suitable pairing function operating on individuals. This short paper shows that this existence and categoricity result does not rely (even indirectly) on finite-set induction, thereby sustaining Feferman and Hellman's point in favor of the view that natural number induction can be derived from a (...) very weak fragment of finite-set theory, so weak that finite-set induction is not assumed. Many basic features of finiteness fail to hold in these weak fragments, conspicuously the principle that finite sets are in one-one correspondence with a proper initial segments of a (any) natural number structure. In the last part of the paper, we propose two prima facie evident principles for finite sets that, when added to these fragments, entail this principle. (shrink)

We present a formalization of first-order predicate calculus with equality which, unlike traditional systems with axiom schemata or substitution rules, is finitely axiomatized in the sense that each step in a formal proof admits only finitely many choices. This formalization is primarily based on the inference rule of condensed detachment of Meredith. The usual primitive notions of free variable and proper substitution are absent, making it easy to verify proofs in a machine-oriented application. Completeness results are presented. The (...) example of Zermelo-Fraenkel set theory is shown to be finitely axiomatized under the formalization. The relationship with resolution-based theorem provers is briefly discussed. A closely related axiomatization of traditional predicate calculus is shown to be complete in a strong metamathematical sense. (shrink)

The view that plural reference is reference to a set is examined in light of George Boolos's treatment of second-order quantification as plural quantification in English. I argue that monadic second-order logic does not, in Boolos's treatment, reflect the behavior of plural quantifiers under negation and claim that any sentence that properly translates a second-order formula, in accordance with his treatment, has a first-order formulation. Support for this turns on the use of certain partitive constructions to assign values to variables (...) in a way that makes Boolos's reading of second-order variables available for a first-order language and, with it, the possibility of interpreting quantification in an unrestricted domain.A first-order theory, T(D), is developed on the basis of Boolos's treatment of simple plural definite descriptions extended to Richard Sharvy's general theory of definite plural and mass descriptions. I introduce a primitive predicate, o, for the relation of the referent of a singular description to that of its plural. If o is simply added to T(D), is definable in T(D), and the result is inconsistent. If o is added to a theory with axioms for the fragment of T(D) I call D-mereology, the result is a natural basis for the development of a pluralized Zermelo set theory. This theory, however, is inconsistent in an unrestricted domain, unless it is recast as a second-order theory of sets interpreted in Boolos's way. (shrink)

Mereology in its formal guise is usually couched in a language whose signature contains only one primitive binary predicate symbol representing the part of relation, either the proper or improper one. In this paper, we put forward an approach to mereology that uses mereological sum as its primitive notion, and we demonstrate that it is definitionally equivalent to the standard parthood-based theory of mereological structures.

This paper develops an account of the meaning of `ought', and the distinction between weak necessity modals (`ought', `should') and strong necessity modals (`must', `have to'). I argue that there is nothing specially ``strong'' about strong necessity modals per se: uses of `Must p' predicate the (deontic/epistemic/etc.) necessity of the prejacent p of the actual world (evaluation world). The apparent ``weakness'' of weak necessity modals derives from their bracketing whether the necessity of the prejacent is verified in the actual (...) world. `Ought p' can be accepted without needing to settle that the relevant considerations (norms, expectations, etc.) that actually apply verify the necessity of p. I call the basic account a modal-past approach to the weak/strong necessity modal distinction (for reasons that become evident). Several ways of implementing the approach in the formal semantics/pragmatics are critically examined. The account systematizes a wide range of linguistic phenomena: it generalizes across flavors of modality; it elucidates a special role that weak necessity modals play in discourse and planning; it captures contrasting logical, expressive, and illocutionary properties of weak and strong necessity modals; and it sheds light on how a notion of `ought' is often expressed in other languages. These phenomena have resisted systematic explanation. In closing I briefly consider how linguistic inquiry into differences among necessity modals may improve theorizing on broader philosophical issues. (shrink)

A first-order language with a defined identity predicate is proposed whose apparatus for atomic predication is sensitive to grammatical categories of natural language. Subatomic natural deduction systems are defined for this naturalistic first-order language. These systems contain subatomic systems which govern the inferential relations which obtain between naturalistic atomic sentences and between their possibly composite components. As a main result it is shown that normal derivations in the defined systems enjoy the subexpression property which subsumes the subformula property with (...) respect to atomic and identity formulae as a special case. The systems admit a proof-theoretic semantics which does not only apply to logically compound but also to atomic and identity formulae—as well as to their components. The potential of the defined systems for a meticulous first-order analysis of natural inferences whose validity crucially depends on expressions of some of the aforementioned categories is demonstrated. (shrink)

Carnap's theory of descriptions was restricted in two ways. First, the descriptive conditions had to be non-modal. Second, only primitive predicates or the identity predicate could be used to predicate something of the descriptum . The motivating reasons for these two restrictions that can be found in the literature will be critically discussed. Both restrictions can be relaxed, but Carnap's theory can still be blamed for not dealing adequately with improper descriptions.

In explaining the notion of a fundamental property or relation, metaphysicians will often draw an analogy with languages. The fundamental properties and relations stand to reality as the primitive predicates and relations stand to a language: the smallest set of vocabulary God would need in order to write the “book of the world.” This paper attempts to make good on this metaphor. To that end, a modality is introduced that, put informally, stands to propositions as logical truth stands to (...) sentences. The resulting theory, formulated in higher-order logic, also vindicates the Humean idea that fundamental properties and relations are freely recombinable and a variant of the structural idea that propositions can be decomposed into their fundamental constituents via logical operations. Indeed, it is seen that, although these ideas are seemingly distinct, they are not independent, and fall out of a natural and general theory about the granularity of reality. (shrink)

Carnap's early system of inductive logic make degrees of confirmation depend on the languages in which they are expressed. They are sensitive to which predicates are, in the language, taken as primitive. Hence they fail to be ‘linguistically invariant’. His later systems, in which prior probabilities are assigned to elements of a model rather than sentences of a language, are sensitive to which properties in the model are called primitive. Critics have often protested against these features of his (...) work. This paper shows how to make his systems independent of any choice of primitive predicates or primitive properties.The solution is related to another criticism of inductive logic. It has been noticed that Carnap's systems are too all-embracing. Hisc(h, e) is defined for all sentencesh ande. Yet for manyh ande, the evidencee does not warrant any assessment of the probability ofh. We need an inductive logic in whichc(h, e) is defined only whene really does bear onh. This paper sketches the measure theory of such a logic, and, within this measure theory, provides ‘relativized’ versions of Carnap's systems which are linguistically invariant. (shrink)

We introduce and analyze a new axiomatic theory$\mathsf {CD}$of truth. The primitive truth predicate can be applied to sentences containing the truth predicate. The theory is thoroughly classical in the sense that$\mathsf {CD}$is not only formulated in classical logic, but that the axiomatized notion of truth itself is classical: The truth predicate commutes with all quantifiers and connectives, and thus the theory proves that there are no truth value gaps or gluts. To avoid inconsistency, the instances (...) of the T-schema are restricted todeterminatesentences. Determinateness is introduced as a further primitive predicate and axiomatized. The semantics and proof theory of$\mathsf {CD}$are analyzed. (shrink)

Presupposing that most predicates do not correspond directly to genuine relations, I argue that all genuine relations are symmetric. My main argument depends on the premise that there are no brute necessities, interpreted so as to require logical and metaphysical necessity to coincide for sentences composed entirely of logical vocabulary and primitive predicates. Given this premise, any set of purportedly primitive predicates by which one might hope to express the facts about non-symmetric relations order their relata will generate (...) an objectionable multiplication of possibilities. In the final section I give a different argument, based on the weaker premise that brute necessities should not be multiplied without necessity. (shrink)

Although Aristotle (Metaphysics, Book IV, Chapter 2) was perhaps the first person to consider the part-whole relationship to be a proper subject matter for philosophic inquiry, the Polish logician Stanislow Lesniewski [15] is generally given credit for the first formal treatment of the subject matter in his Mereology.1 Woodger [30] and Tarski [24] made use of a specific adaptation of Lesniewski's work as a basis for a formal theory of physical things and their parts. The term 'calculus of individuals' was (...) introduced by Leonard and Goodman [14] in their presentation of a system very similar to Tarski's adaptation of Lesniewski's Mereology. Contemporaneously with Lesniewski's development of his Mereology, Whitehead [27] and [28] was developing a theory of extensive abstraction based on the two-place predicate, 'x extends over y\ which is the converse of 'x is a part of y\ This system, according to Russell [22], was to have been the fourth volume of their Pήncipia Mathematica, the never-published volume on geometry. Both Lesniewski [15] and Tarski [25] have recognized the similarities between Whitehead's early work and Lesniewski's Mereology. Between the publication of Whitehead's early work and the publication of Process and Reality [29], Theodore de Laguna [7] published a suggestive alternative basis for Whitehead's theory. This led Whitehead, in Process and Reality, to publish a revised form of his theory based on the two-place predicate, 'x is extensionally connected with y\ It is the purpose of this paper to present a calculus of individuals based on this new Whiteheadian primitive predicate. (shrink)

Suspended judgment poses a serious problem for Russellianism. In this paper I examine several possible solutions to this problem and argue that none of them is satisfactory. Then I sketch a new solution. According to this solution, suspended judgment should be understood as a sui generis propositional attitude. By this I mean that it cannot be reduced to, or explained in terms of, other propositional attitudes, such as belief. Since suspended judgment is sui generis in this sense, sentences that ascribe (...) this attitude to someone should not be analyzed in terms of other attitude ascriptions, such as belief ascriptions. Instead they should be understood as involving a semantically primitive predicate, corresponding to the state of suspended judgment. (shrink)

We furnish a core-logical development of the Gödel numbering framework that allows metamathematicians to attain limitative results about arithmetical truth without incorporating a genuine truth predicate into the language in a way that would lead to semantic closure. We show how Tarski’s celebrated theorem on the arithmetical undefinability of arithmetical truth can be established using only core logic in both the object language and the metalanguage. We do so at a high level of abstraction, by augmenting the usual first-order (...) language of arithmetic with a primitive predicate Tr and then showing how it cannot be a truth predicate for the augmented language. McGee established an important result about consistent theories that are in the language of arithmetic augmented by such a “truth predicate” Tr and that use Gödel numbering to refer to expressions of the augmented language. Given the nature of his sought result, he was forced to use classical reasoning at the meta level. He did so, however, on the additional and tacit presupposition that the arithmetical theories in question (in the object language) would be closed under classical logic. That left open the dialectical possibility that a constructivist (or intuitionist) could claim not to be discomfited by the results, even if they were to “give a pass” on the unavoidably classical reasoning at the meta level. In this study we “constructivize” McGee’s result, by presuming only core logic for the object language. This shows that the perplexity induced by McGee’s result will confront the constructivist (or intuitionist) as well. (shrink)

The argument from analogy is examined from the standpoint of Carnap's confirmation theory. Carnap's own discussion of analogy in relation to his c*— function is restricted to cases where the analogues are known to be similar, but not known to be different in any respect. It has been argued by the author in a previous work,, and by P. Achinstein, that typical analogy arguments involve known differences between the analogues as well as similarities. Achinstein shows that for such arguments none (...) of Carnap's Δ— system of conflrmation functions gives satisfactory values, and it is further shown in the present paper that for these arguments the confirmation never rises above its initial value, irrespective of evidence drown from an analogue. it is argued that even if inductive arguments are to be applicable to the real world, they must in principle be capable of taking into account known differences between the instances of an inductive generalization. Hence Carnap's Δ— system is inadequate as an explication of both induction and analogy.Three conditions are stated as necessary for any confirmation theory which gives a satisfactory explication of analogical inference:I. If two individuals a and b are known to agree in certain properties and differ in others, and if in addition a has a further property, then the confirmation of the hypothesis that b also has this property is greater than its initial confirmation, at least if the weight of the similarities is sufficiently great compared with the weight of the differences.II. The confirmation‐value increases or decreases with the weight of the similarities between the analogues compared with the weight of their differences.III. The confirmation that b has a certain property is greater if a has that property than if a does not have it.The Δ— system sastisfles none of these conditions. Carnap and Stegmüller have now, however, presented a new anxiom system for confirmation functions. the — system, Which is introduced primarily to deal with languages whose primitive predicates fall into families such that each individual can only be qualified by one predicate of each family. They construct a c‐ function which, as well as dealing with a language having two families of such predicates, also depends, unlike the functions in the Δ— system, on similarities between otherwise different individuals. The system is not developed far enough in this Appendix to enable the authors to discuss the confirmation in analogy arguments satisfying conditions I — III above, but it is shown in the present paper that, with a simple generalization of the measure‐function defined by Carnap and Stegmüller, and in the simplest non‐trivial case, condition I — III are all satisfied, indeed a stronger form of condition I is satisfied, in which no known similarity of the analogues is postulated.Finally it is remarked that Carnap and Stegmüller's method of introducing their Δ— system is extremely arbitrary and ad hoc, and an alternative method of introducing is suggested. Bearing in mind the fundamental nature of the argument from analogy in all application of induction to the real world, it is suggesetd that the fundamental inductive inference needing explication is not the inference of‘P1b, from ‘P,1a, but the analogical infeence of‘P2b, from‘P1P2a.P1b,. It is posinitial confirmation of‘P2b, and the confirmation of‘P2b, given‘P2a” and that the later two confirmation‐values are equivalent to those in the Δ— system. It is then shown that Carnap and Stegmüller's new measure‐function follows from their axiom system together with these postulates. Thus some of the arbitrariness of the — system is removed by general considérations regarding inductive and analogical inference. (shrink)

According to traditional universalism, properties are instantiated by objects, where instantiation is a ‘tie’ that binds objects and properties into facts. I offer two arguments against this view. I then develop an alternative higher-order account which holds that properties are primitively predicated of objects yet, unlike traditional nominalism, are nevertheless genuinely real. When it’s a fact that Fo, it’s not because object o instantiates F-ness, but just that Fo – where F still exists. Against orthodox higher-order approaches, however, my arguments (...) against instantiation also serve to support a sparse conception of properties. In developing the view, I introduce an extension of ontological and ideological commitment in the form of syntactic commitment. (shrink)

This study focuses on certain combinations of rules or conditions involving a would-be ‘provability’ or ‘truth’ predicate that would render a system of arithmetic containing them either straightforwardly inconsistent (if those predicates were assumed to be definable) or logico-semantically paradoxical (if those predicates were taken as primitive and governed by the rules in question). These two negative properties are not to be conflated; we conjecture, however, that they are complementary. Logico-semantic paradoxicality, we contend, admits of proof-theoretic analysis: the (...) ‘disproofs’ involved do not reveal straightforward inconsistency. This is because, unlike the disproofs involved in establishing straightforward inconsistencies, these paradox-revealing ‘disproofs’ cannot be brought into normal form.The border between metamathematical proofs of certain (constructive) impossibility results and the non-normalizable (and always constructive) disproofs engendered by semantic paradoxicality is not fully understood. The respective strategies of reasoning on each side—genuine proofs of inconsistency versus whatever kind of ‘disproof’ uncovers semantic paradoxicality—seem somehow similar. They seem to involve the same ‘lines of reasoning’. But there is an important and principled difference between them.This difference will be emphasized throughout our discussion of certain arithmetical impossibility results, and closely related semantic paradoxes. The proof-theoretic criterion for paradoxicality is that in the case of paradoxes (as opposed to genuine inconsistencies) the apparent ‘disproofs’ that use the rules stipulated for the primitive predicates in question cannot be brought into normal form. In proof-theoretic terminology: their reduction sequences do not terminate. This means that cut fails for languages generating paradox. But cut holds for the language of arithmetic. It follows that the paradox-generating primitive predicates of a semantically closed language cannot be defined in arithmetical terms. For, if they could be, then they could be replaced by their definitions within the paradoxical disproofs, and the resulting disproofs would be normalizable. (shrink)

In his “Are Properties, Particular, Universal, or Neither?” Javier Cumpa argues that science not metaphysics explains how properties are instantiated. I accept this conclusion provided physics can be stated using rather few primitive predicates. In addition, he uses his scientific theory of instantiation to argue for Neutralism, his thesis that the “tie” between properties and their instances implies neither that properties are particular nor that they are universals. Neutralism, I claim, is a thesis that realist about universals have independent (...) reason to accept and their opponents have reason to reject. So, neutralism is not neutral on the topic of whether properties are universals. Nor is Cumpa’s Theory of Instantiation as naturalistic as he claims. I argue that although compatible with Ontological Naturalism, his theory provides a precedent for the non-naturalistic emergence of mental properties. Finally, I argue that because his theory requires a simple physics it presupposes a more rationalist epistemology than that of Methodological Naturalism. (shrink)

The argument from analogy is examined from the standpoint of Carnap's confirmation theory. Carnap's own discussion of analogy in relation to his c* — function is restricted to cases where the analogues are known to be similar, but not known to be different in any respect. It has been argued by the author in a previous work, (Models and Analogies in Science, 1963, p. 121), and by P. Achinstein (Phil Sci, 30,1963, 216), that typical analogy arguments involve known differences between (...) the analogues as well as similarities. Achinstein shows that for such arguments none of Carnap's λ — system of confirmation functions gives satisfactory values, and it is further shown in the present paper that for these arguments the confirmation never rises above its initial value, irrespective of evidence drown from an analogue. It is argued that even if inductive arguments are to be applicable to the real world, they must in principle be capable of taking into account known differences between the instances of an inductive generalization. Hence Carnap's λ — system is inadequate as an explication of both induction and analogy. Three conditions are stated as necessary for any confirmation theory which gives a satisfactory explication of analogical inference : I. If two individuals a and b are known to agree in certain properties and differ in others, and if in addition á has a further property, then the confirmation of the hypothesis that b also has this property is greater than its initial confirmation, at least if the weight of the similarities is sufficiently great compared with the weight of the differences. II. The confirmation-value increases or decreases with the weight of the similarities between the analogues compared with the weight of their differences. III. The confirmation that b has a certain property is greater if a has that property than if a does not have it. The λ — system satisfies none of these conditions. Carnap and Stegmüller have now, however, presented a new axiom system for confirmation functions, the η — system (Induktive Logik und Wahrscheinlichkeit, 1959, Appendix B), which is introduced primarily to deal with languages whose primitive predicates fall into families such that each individual can only be qualified by one predicate of each family. They construct a c-function which, as well as dealing with a language having two families of such predicates, also depends, unlike the functions in the λ — system, on similarities between otherwise different individuals. The system is not developed far enough in this Appendix to enable the authors to discuss the confirmation in analogy arguments satisfying conditions I — III above, but it is shown in the present paper that, with a simple generalization of the measure-function defined by Carnap and Stegmüller, and in the simplest non-trivial case, conditions I — III are all satisfied, indeed a stronger form of condition I is satisfied, in which no known similarity of the analogues is postulated. Finally it is remarked that Carnap and Stegmuller's method of introducing their η — system is extremely arbitrary and ad hoc, and an alternative method of introducing is suggested. Bearing in mind the fundamental nature of the argument from analogy in all application of induction to the real world, it is suggested that the fundamental inductive inference needing explication is not the inference of 'P¹b, from 'P¹a, but the analogical inference of 'P²b, from 'P¹P²a.P¹b, (where 'P, denotes not-P). It is postulated that the confirmation of this inference is a weighted mean of the initial confirmation of 'P²b, and the confirmation of 'P²b, given 'P²a„ and that the latter two confirmation-values are equivalent to those in the λ — system. It is then shown that Carnap and Stegmuller's new measure-function follows from their axiom system together with these postulates. Thus some of the arbitrariness of the η — system is removed by general considérations regarding inductive and analogical inference. (shrink)

This dissertation elucidates the notion of physical system which opens new conceptual pathways that connect the three realms of physical theory; spacetime, material bodies and their properties, and the laws of nature which govern their evolution. The notion of physical system includes two presuppositions regarding their structure. The first presupposition is a description of isolated systems and their evolution in time, which amounts to a Paradigm of Uniform Motion. The second presupposition describes how parts of a physical system are combined (...) into wholes. This presupposition amounts to a Rule of Composition. Once we make these presuppositions explicit we can derive the spacetime structures and the fundamental equations of motion. "Newtonian" and "relativistic" systems are shown to differ with respect to the paradigm of uniform motion, a difference that leads to the respective structures of Newtonian mechanics and the Special Theory of Relativity. ;The philosophical framework offered in this dissertation provides a new interpretation of the concept of mass, and a new elucidation of the relation between the conservations of mass and momentum. Previous analyses of the concept have claimed that "mass" cannot be defined and broken down to more primitive predicates. The framework offered here, on the other hand, enables the systematic reduction of the concept of mass to motions and the presuppositions we have regarding the nature of physical systems. The new interpretation of mass reveals a surprising connection between mass and inertial reference frames, as they are both shown to be derived, in a similar way, from our definition of physical systems. Mass is by necessity attributed to bodies in virtue of the frame we use to describe their motions. This account also enables us to understand the different conceptual roles of mass and their interconnections. In the context of Newtonian mechanics, the roles of mass as a Quantity of Matter, as the Inertial property of bodies, and as Gravitational mass are shown to be various aspects of a single role the concept has in the new framework offered here. In the context of the Special Theory of Relativity, rest mass and relativistic mass are similarly analyzed as consequences of our presuppositions regarding physical systems. (shrink)

This is an attempt to formulate (along the line of H. Field's nominalization program) purely qualitative versions of two theories of space time: Galilean and Minkowskian theories. The starting point is to present qualitative theory for affine geometry, which is based only on one primitive predicate: „between”. Then it is shown that with the help of this predicate whole mathematical structure of affine geometry can be reconstructed as a simple definitional extension. As a next step it is (...) shown in details how the same procedure can be carried out for both theories mentioned above. (shrink)

This book concerns the philosophical analysis of modal sentences. David Lewis' Modal Translation Scheme 'translates' sentences of quantified modal logic into sentences of predicate logic supplemented by counterpart theory. A number of theoretical advantages are thereby secured. One component of the translation scheme makes reference to non-actual but possible worlds i.e. the primitive predicate "at a world(s), w". The author addresses the problem of advanced modal sentences which threaten this predicate and so the ability of genuine (...) realism to secure the aforementioned theoretical benefits. The problem of advanced modal sentences is a relatively new field of philosophical research. This ground-breaking book will primarily be of interest to researchers in modality, particularly those working in this field. (shrink)

With the help of six primitive predicates the author formulates twenty-seven basic ontological theses. The primitive terms used are referring to the so-called elementary ontic relations, which are not reducible to each other. These are: the relation of being a part, the relation of being localized, the relation of temporal precedence, and the epistemic relation - knowing that.

In this landmark paper, Lewis outlines his theory of modality and counterparts. The eight postulates constitutive of Lewis's counterpart theory are expressed in an extensional first‐order language that replaces the modal operators (characteristic of traditional quantified modal logic) with four primitive predicates: ‘x is a possible world’, ‘x is in possible world y’, ‘x is actual’, and ‘x is a counterpart of y’. Upon presenting a scheme for translating sentences expressed in quantified modal logic into those expressed in his (...) preferred extensional language, Lewis demonstrates that the latter is nevertheless a richer language; while every sentence of quantified modal logic may be translated into a sentence expressed in counterpart theory, the reverse is not the case. Lewis concludes the paper by considering the implications of his view for several well‐known topics (notably, Aristotelian essentialism). The postscript includes numerous additions and emendations (including a specification of the primitive predicate, ‘x is in possible world y’). (shrink)

We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of predicate calculus. Our algebraic framework unifies natural joins and data dependencies of database theory and relational algebra of clone theory with the bond algebra of C.S. Peirce. We also offer new constructions of reductions, systematically study irreducible relations and reductions to them and introduce a new (...) characteristic of relations, ternarity, that measures their ‘complexity of relating’ and allows to refine reduction results. In particular, we refine Peirce’s controversial reduction thesis, and show that reducibility behaviour is dramatically different on finite and infinite domains. (shrink)

The systems T N and T M show that necessity can be consistently construed as a predicate of syntactical objects, if the expressive/deductive power of the system is deliberately engineered to reflect the power of the original object language operator. The system T N relies on salient limitations on the expressive power of the language L N through the construction of a quotational hierarchy, while the system T Mrelies on limiting the scope of the modal axioms schemas to the (...) sublanguage L infM +, which corresponds exactly with the restrictive hierarchy of L N. The fact that L infM + is identical to the image of the metalinguistic mapping C + from the normal operator system into L M reveals that iterated operator modality is implicitly hierarchical, and that inconsistency is produced by applying the principles of the modal logic to formulas which have no natural analogues in the operator development. Thus the contradiction discovered by Montague can be diagnosed as the result of instantiating the axiom schemas with modally ungrounded formulas, and thereby adding radically new modal axioms to the predicate system.The predicate treatment of necessity differs significantly from that of the operator in that the cumulative models for the predicate system are strictly first-order. Possible worlds are not used as model-theoretic primitives, but rather alternate models are appealed to in order to specify the extension of N, which is semantically construed as a first-order predicate. In this manner, the intensional aspects of modality are built into the mode of specifying the particular set of objects which the denotation function assigns to N, rather than in the specification of the basic truth conditions for modal formulas. Intensional phenomena are thereby localised to the special requirements for determining the extension of a particular predicate, and this does not constitute a structural modification of the first-order models, but rather limits the relevant class of models to those which possess an appropriate denotation function. (shrink)

All the known non-self-referential paradoxes share a reference pattern of Yablo’s paradox in that they all necessarily contain infinitely many sentences, each of which refers to infinitely many sentences. This raises a question: Does the reference pattern of Yablo’s paradox underlie all non-self-referential paradoxes, just as the reference pattern of the liar paradox underlies all finite paradoxes? In this regard, Rabern et al. [J Philos Logic 42(5): 727–765, 2013] prove that every dangerous acyclic digraph contains infinitely many points with an (...) infinite out-degree. Building upon their work, this paper extends Rabern et al.’s result to the first-order arithmetic language with a primitive truth predicate, proving that all reference digraphs for non-self-referential paradoxes contain infinitely many sentences of infinite out-degree (called “social sentences”). We then strengthen this result in two respects. First, among these social sentences, infinitely many appear in one ray. Second, among these social sentences, infinitely many have infinitely many out-neighbors, none of which will eventually get to a sink. These observations provide helpful information towards the following conjecture proposed by Beringer and Schindler [Bull. of Symb. Logic 23(4): 442–492, 2017]: every dangerous acyclic digraph contains the Yablo digraph as a finitary minor. (shrink)

The usual axioms and inference rules of deontic logic employ as a new primitive term an operator for ‘obligatory’ or for ‘permitted’. These axioms and inference rules are here derived from a language which instead of the operator contains a predicate ‘admissible’ defined on the set of state descriptions of an assertoric language. This approach eliminates the problem of constructing a deontic formalism of its own. The predicate version requires fewer and weaker decisions and is closer to (...) intuitive notions than the operator version. The solutions of some open problems of deontic logic flow automatically from the well-known rules of the assertoric predicate calculus. Special attention is given to the relations between deontic and assertoric statements.The proposed formulation of deontic logic suggests a natural generalization by proceeding from two to any number of degrees of admissibility. When there is a continuum of degrees of desirability, deontic logic becomes identical with the calculus of utilities. (shrink)

Beginning with Nelson Goodman’s notion of exemplification, the possibility of using non-word objects to fulfil the predicative function ordinarily accomplished by words and expressions in language is described. It is shown that there are in fact many kinds of cases in which this function called ‘qualification’ does figure, albeit unnoticed, in dealings with objects. This notion of qualification is intended to be correlative with, and of the same generality as, reference, and with reference it enables a better understanding of the (...) primitive structure that Quine and Strawson call the ‘basic combination’. Aside from its importance to philosophical logic, qualification serves as one of the main ingredients in the account of metaphor. (shrink)