The purpose of this paper is to outline an alternative approach to introductory logic courses. Traditional logic courses usually focus on the method of natural deduction or introduce predicate calculus as a system. These approaches complicate the process of learning different techniques for dealing with categorical and hypothetical syllogisms such as alternate notations or alternate forms of analyzing syllogisms. The author's approach takes up observations made by Dijkstrata and assimilates them into a reasoning process based on modified notations. (...) The author's model adopts a notation that addresses the essentials of a problem while remaining easily manipulated to serve other analytic frameworks. The author also discusses the pedagogical benefits of incorporating the model into introductory logic classes for topics ranging from syllogisms to predicate calculus. Since this method emphasizes the development of a clear and manipulable notation, students can worry less about issues of translation, can spend more energy solving problems in the terms in which they are expressed, and are better able to think in abstract terms. (shrink)

This article identifies and formalizes the logical features of analogous terms that justify their use in deduction. After a survey of doctrines in Aristotle, Aquinas, and Cajetan, the criteria of “analogy of proper proportionality” are symbolized in first-order predicate logic. A common genus justifies use of a common term, but does not provide the inferential link required for deduction. Rather, the respective differentiae foster this link through their identical proportion. A natural-language argument by analogy is formalized so as to (...) exhibit these criteria, thereby showing the validity of analogical deduction. (shrink)

Hilbert's ε-calculus is based on an extension of the language of predicate logic by a term-forming operator εx. Two fundamental results about the ε-calculus, the first and second epsilon theorem, play a rôle similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand's Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of (...) Herbrand disjunctions of existential theorems obtained by this elimination procedure. (shrink)

In the history of philosophy, the distinction between positive and negative predication has been collapsed. The collapse has caused us to search for a way through Parmenides’ gate: we have constructed scaffolding to see over its boundaries. Kant gave us the distinction between conceptual and non-conceptual knowledge; Hegel gave us determinate negation; Frege gave us the negation stroke; Husserl gave us bracketing and disappointment; G. Spencer-Brown gave us a calculus of distinction. Despite this, we find ourselves—alongside Wittgenstein— wondering how (...) it can be the case that we are able to think what is not the case. We are puzzled by the fact that we can think nothing without the thought lacking content. I suggest that this confusion is unnecessary. Throughout this work, I exercise the thought that the distinction between positive and negative predication is mistaken. I rather suggest that to think what is or is not the case necessarily depends upon an exemplar distinction that is experientially recognized and learned in the world. All the same, our capacity to understand natural distinction likewise depends upon our practical and pervasively conceptual capacities to express it in language. I conclude by suggesting that what makes positive and negative predication distinct is a fundamental unity in conceptual form through its capacity to play distinct functional roles in linguistic practice. (shrink)

The syllogism and the predicate calculus cannot account for an ontological argument in Descartes' Fifth Meditation and related texts. Descartes' notion of god relies on the analytic-synthetic distinction, which Descartes had identified before Leibniz and Kant did. I describe how the syllogism and the predicate calculus cannot explain Descartes' ontological argument; then I apply the analytic-synthetic distinction to Descartes’ idea of god.

The quantified argument calculus (Quarc) is a novel logic that departs in several ways from mainstream first-order logic. In particular, its quantifiers are not sentential operators attached to variables, but attach to unary predicates to form arguments – quantified arguments – of other predicates. Furthermore, Quarc includes devices to account for anaphora, active-passive-voice distinctions, and sentence- versus predicate-negation. While this base system has already been shown to be sound and complete, modal extensions still lack such results. The present (...) paper fills this lacuna by developing a modal extension of Quarc, including identity. The semantics will invalidate the Quarc-analogues of the Barcan-formula and its converse, as well as treat identity as contingent by default. Furthermore, an unlabelled Gentzen-style natural deduction system will be presented, which includes the full expressive power of Quarc. It will be shown to be strongly sound and complete with respect to relational frames. The paper closes off with considerations on how to extend the system to cover other normal modal logics as well as extensions to suitable three-valued semantics that capture relevant types of presupposition-failure. (shrink)

Inferentialism is a theory in the philosophy of language which claims that the meanings of expressions are constituted by inferential roles or relations. Instead of a traditional model-theoretic semantics, it naturally lends itself to a proof-theoretic semantics, where meaning is understood in terms of inference rules with a proof system. Most work in proof-theoretic semantics has focused on logical constants, with comparatively little work on the semantics of non-logical vocabulary. Drawing on Robert Brandom’s notion of material inference and Greg Restall’s (...) bilateralist interpretation of the multiple conclusion sequent calculus, I present a proof-theoretic semantics for atomic sentences and their constituent names and predicates. The resulting system has several interesting features: (1) the rules are harmonious and stable; (2) the rules create a structure analogous to familiar model-theoretic semantics; and (3) the semantics is compositional, in that the rules for atomic sentences are determined by those for their constituent names and predicates. (shrink)

In the article we consider the relationship of traditional provisions of basic logical concepts and confront them with new and modern approaches to the same concepts. Logic is characterized in different ways when it is associated with syllogistics (referential – semantical model of logic) or with symbolic logic (inferential – syntactical model of logic). This is not only a difference in the logical calculation of (1) concepts, (2) statements, and (3) predicates, but this difference also appears in the treatment of (...) the calculative abilities of logical forms, the ontological-referential status of conceptual content and the inferential-categorical status of logical forms. The basic markers or basic ideas that separate ontologically oriented logic from categorically oriented logic are the (1) concept of truth, the (2) concept of meaning, the (3) concept of identity, and the (4) concept of predication. Here, this differences are explicitly demonstrated by the introduction of differential terminology. From this differential methodology follows a new set of characterizations of logic. (shrink)

The first learning game to be developed to help students to develop and hone skills in constructing proofs in both the propositional and first-order predicate calculi. It comprises an autotelic (self-motivating) learning approach to assist students in developing skills and strategies of proof in the propositional and predicate calculus. The text of VALIDITY consists of a general introduction that describes earlier studies made of autotelic learning games, paying particular attention to work done at the Law School of (...) Yale University, called the ALL Project (Accelerated Learning of Logic). Following the introduction, the game of VALIDITY is described, first with reference to the propositional calculus, and then in connection with the first-order predicate calculus with identity. Sections in the text are devoted to discussions of the various rules of derivation employed in both calculi. Three appendices follow the main text; these provide a catalogue of sequents and theorems that have been proved for the propositional calculus and for the predicate calculus, and include suggestions for the classroom use of VALIDITY in university-level courses in mathematical logic. (shrink)

Which premisses should we use to start our inquiries? Which transitions during inquiry should we take next? When should we switch lines of inquiry? In this paper, I address these open questions about inquiry, formulating novel norms for such decisions during deductive reasoning. I use the first-order predicate calculus, in combination with Carnap’s state description framework, to state such norms. Using that framework, I first demonstrate some properties of sets of sentences used in deduction. I then state some (...) norms for decisions made during deductive reasoning, establishing initial benchmarks for efficient deduction by ideal reasoners. When deciding which transition to make next, reasoners should choose the most informative transition, the one that maximally reduces uncertainty in the sense of ruling out the largest number of state descriptions relevant to their inquiry. Finally, inspired by optimal foraging theory, I show that, under certain assumptions of ignorance, reasoners should change premiss sets when their information intake drops below the global average information intake across premiss sets. (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)

I show that intuitive and logical considerations do not justify introducing Leibniz’s Law of the Indiscernibility of Identicals in more than a limited form, as applying to atomic formulas. Once this is accepted, it follows that Leibniz’s Law generalises to all formulas of the first-order Predicate Calculus but not to modal formulas. Among other things, identity turns out to be logically contingent.

The question as to what makes a perfect Aristotelian syllogism a perfect one has long been discussed by Aristotelian scholars. G. Patzig was the first to point the way to a correct answer: it is the evidence of the logical necessity that is the special feature of perfect syllogisms. Patzig moreover claimed that the evidence of a perfect syllogism can be seen for Barbara in the transitivity of the a-relation. However, this explanation would give Barbara a different status over the (...) other three first figure syllogisms. I argue that, taking into account the role of the being-contained-as-in-a-whole formulation, transitivity can be seen to be present in all four first figure syllogisms. Using this wording will put the negation sign with the predicate, similar to the notation in modern predicate calculus. (shrink)

I explain why model theory is unsatisfactory as a semantic theory and has drawbacks as a tool for proofs on logic systems. I then motivate and develop an alternative, the truth-valuational substitutional approach (TVS), and prove with it the soundness and completeness of the first order Predicate Calculus with identity and of Modal Propositional Calculus. Modal logic is developed without recourse to possible worlds. Along the way I answer a variety of difficulties that have been raised against (...) TVS and show that, as applied to several central questions, model-theoretic semantics can be considered TVS in disguise. The conclusion is that the truth-valuational substitutional approach is an adequate tool for many of our logic inquiries, conceptually preferable over model-theoretic semantics. Another conclusion is that formal logic is independent of semantics, apart from its use of the notion of truth, but that even with respect to it its assumptions are minimal. (shrink)

This is the 3rd edition. Although a number of new technological applications require classical deductive computation with non-classical logics, many key technologies still do well—or exclusively, for that matter—with classical logic. In this first volume, we elaborate on classical deductive computing with classical logic. The objective of the main text is to provide the reader with a thorough elaboration on both classical computing – a.k.a. formal languages and automata theory – and classical deduction with the classical first-order predicate (...) class='Hi'>calculus with a view to computational implementations, namely in automated theorem proving and logic programming. The present third edition improves on the previous ones by providing an altogether more algorithmic approach: There is now a wholly new section on algorithms and there are in total fourteen clearly isolated algorithms designed in pseudo-code. Other improvements are, for instance, an emphasis on functions in Chapter 1 and more exercises with Turing machines. (shrink)

It is widely taken that the first-order part of Frege's Begriffsschrift is complete. However, there does not seem to have been a formal verification of this received claim. The general concern is that Frege's system is one axiom short in the first-order predicate calculus comparing to, by now, the standard first-order theory. Yet Frege has one extra inference rule in his system. Then the question is whether Frege's first-order calculus is still deductively sufficient as far as the (...) first-order completeness is concerned. In this short note we confirm that the missing axiom is derivable from his stated axioms and inference rules, and hence the logic system in the Begriffsschrift is indeed first-order complete. (shrink)

This study focuses on undergraduate students' ability to unpack informally written mathematical statements into the language of predicate calculus. Data were collected between 1989 and 1993 from 61students in six small sections of a “bridge" course designed to introduce proofs and mathematical reasoning. We discuss this data from a perspective that extends the notion of concept image to that of statement image and introduces the notion of proof framework to indicate the top-level logical structure of a proof. For (...) simplified informal calculus statements, just 8.5% of unpacking attempts were successful; for actual statements from calculus texts, this dropped to 5%. We infer that these students would be unable to reliably relate informally stated theorems with the top-level logical structure of their proofs and hence could not be expected to construct proofs or evaluate their validity. (shrink)

By pure calculus of names we mean a quantifier-free theory, based on the classical propositional calculus, which defines predicates known from Aristotle’s syllogistic and Leśniewski’s Ontology. For a large fragment of the theory decision procedures, defined by a combination of simple syntactic operations and models in two-membered domains, can be used. We compare the system which employs `ε’ as the only specific term with the system enriched with functors of Syllogistic. In the former, we do not need an (...) empty name in the model, so we are able to construct a 3-valued matrix, while for the latter, for which an empty name is necessary, the respective matrices are 4-valued. (shrink)

My objective is a better comprehension of two theoretically fundamental concepts. One, the concept of a substance in an ordinary (non-Aristotelian) sense, ranging over such things as salt, carbon, copper, iron, water, and methane – kinds of stuff that now count as (chemical) elements and compounds. The other I’ll call the object-concept in the abstract sense of Russell, Wittgenstein, and Frege in their logico-semantical enquiries. The material object-concept constitutes the heart of our received logico / ontic system, still massively influenced (...) by Aristotle after almost 2.5 millennia. On such an account, the fundamentality of material objects and their attributes are the metaphysical basis of the cosmos, as reflected in our received logic, Quine’s ‘canonical notation’ – derived via the empiricism of Russell from Frege’s function-based Begriffschrifft, and consisting of concrete singular terms and variables, quantifiers and predicate-expressions. The inadequacy of Frege’s approach to understanding concepts is reflected in his initial question. Frege enquires of ‘what it is that we are calling an object’, remarking that he regards a regular definition as impossible: “we have here something too simple to admit of logical analysis”. The imagined ultimacy or simplicity of the idea of a single object (arithmetically, just a unit – one as against two, three, four, etc.) as foundational to the calculus is just that – imagined. It is also guaranteed to block the comprehension of the substance-concept. (shrink)

This paper presents and motivates a new philosophical and logical approach to truth and semantic paradox. It begins from an inferentialist, and particularly bilateralist, theory of meaning---one which takes meaning to be constituted by assertibility and deniability conditions---and shows how the usual multiple-conclusion sequent calculus for classical logic can be given an inferentialist motivation, leaving classical model theory as of only derivative importance. The paper then uses this theory of meaning to present and motivate a logical system---ST---that conservatively extends (...) classical logic with a fully transparent truth predicate. This system is shown to allow for classical reasoning over the full (truth-involving) vocabulary, but to be non-transitive. Some special cases where transitivity does hold are outlined. ST is also shown to give rise to a familiar sort of model for non-classical logics: Kripke fixed points on the Strong Kleene valuation scheme. Finally, to give a theory of paradoxical sentences, a distinction is drawn between two varieties of assertion and two varieties of denial. On one variety, paradoxical sentences cannot be either asserted or denied; on the other, they must be both asserted and denied. The target theory is compared favourably to more familiar related systems, and some objections are considered. (shrink)

An important lesson that philosophy can learn from the Turing Test and computer science more generally concerns the careful use of the method of Levels of Abstraction (LoA). In this paper, the method is first briefly summarised. The constituents of the method are “observables”, collected together and moderated by predicates restraining their “behaviour”. The resulting collection of sets of observables is called a “gradient of abstractions” and it formalises the minimum consistency conditions that the chosen abstractions must satisfy. Two useful (...) kinds of gradient of abstraction – disjoint and nested – are identified. It is then argued that in any discrete (as distinct from analogue) domain of discourse, a complex phenomenon may be explicated in terms of simple approximations organised together in a gradient of abstractions. Thus, the method replaces, for discrete disciplines, the differential and integral calculus, which form the basis for understanding the complex analogue phenomena of science and engineering. The result formalises an approach that is rather common in computer science but has hitherto found little application in philosophy. So the philosophical value of the method is demonstrated by showing how making the LoA of discourse explicit can be fruitful for phenomenological and conceptual analysis. To this end, the method is applied to the Turing Test, the concept of agenthood, the definition of emergence, the notion of artificial life, quantum observation and decidable observation. It is hoped that this treatment will promote the use of the method in certain areas of the humanities and especially in philosophy. (shrink)

This paper describes a decision procedure for disjunctions of conjunctions of anti-prenex normal forms of pure first-order logic (FOLDNFs) that do not contain V within the scope of quantifiers. The disjuncts of these FOLDNFs are equivalent to prenex normal forms whose quantifier-free parts are conjunctions of atomic and negated atomic formulae (= Herbrand formulae). In contrast to the usual algorithms for Herbrand formulae, neither skolemization nor unification algorithms with function symbols are applied. Instead, a procedure is described that rests on (...) nothing but equivalence transformations within pure first-order logic (FOL). This procedure involves the application of a calculus for negative normal forms (the NNF-calculus) with A -||- A & A (= &I) as the sole rule that increases the complexity of given FOLDNFs. The described algorithm illustrates how, in the case of Herbrand formulae, decision problems can be solved through a systematic search for proofs that reduce the number of applications of the rule &I to a minimum in the NNF-calculus. In the case of Herbrand formulae, it is even possible to entirely abstain from applying &I. Finally, it is shown how the described procedure can be used within an optimized general search for proofs of contradiction and what kind of questions arise for a &I-minimal proof strategy in the case of a general search for proofs of contradiction. (shrink)

Combinatory logic (Curry and Feys 1958) is a “variable-free” alternative to the lambda calculus. The two have the same expressive power but build their expressions differently. “Variable-free” semantics is, more precisely, “free of variable binding”: it has no operation like abstraction that turns a free variable into a bound one; it uses combinators—operations on functions—instead. For the general linguistic motivation of this approach, see the works of Steedman, Szabolcsi, and Jacobson, among others. The standard view in linguistics is that (...) reflexive and personal pronouns are free variables that get bound by an antecedent through some coindexing mechanism. In variable free semantics the same task is performed by some combinator that identifies two arguments of the function it operates on (a duplicator). This combinator may be built into the lexical semantics of the pronoun, into that of the antecedent, or it may be a free-floating operation applicable to predicates or larger chunks of texts, i.e. a typeshifter. This note is concerned with the case of cross-sentential anaphora. It adopts Hepple’s and Jacobson’s interpretation of pronouns as identity maps and asks how this can be extended to the cross-sentential case, assuming the dynamic semantic view of anaphora. It first outlines the possibility of interpreting indefinites that antecede non-ccommanded pronouns as existential quantifiers enriched with a duplicator. Then it argues that it is preferable to use the duplicator as a type-shifter that applies “on the fly”. The proposal has consequences for two central ingredients of the classical dynamic semantic treatment: it does away with abstraction over assignments and with treating indefinites as inherently existentially quantified. However, cross-sentential anaphora remains a matter of binding, and the idea of propositions as context change potentials is retained. (shrink)

In this paper, I want to look at the way in which Deleuze's reading of Kant's transcendental dialectic influences some of the key thèmes of Différence and Répétition. As we shall see, in the transcendental dialectic, Kant takes the step of claiming that reason, in its natural functioning, is prone to misadventures. Whereas for Descartes, for instance, error takes place between two faculties, such as when reason (wrongly) infers that a stick in water is bent on the basis of sensé (...) impressions, Kant postulâtes that reason générâtes illusions internally purely in the course of its natural function. It is thèse illusions which lead reason into antinomy, as on the basis of thèse illusions, it is led to posit an illegitimate concept of the world as a totality. Further, for Kant, the antinomies represent an indirect proof of transcendental idealism, as it is only with the additional assumption of the noumenon, as that which falls outside of appearance, that we are able to résolve the antinomies. Deleuze's work on the image of thought clearly owes a great deal to Kant's theory of transcendental illusion, but the connections between Kant's transcendental dialectic and the structure of Différence and Répétition go deeper than this. Whereas Kant's problem is that reason générâtes contradictions when it assumes that the unconditioned can be given to reason, Deleuze's problem is the impossibility of developing a concept of différence within représentation. Between thèse two problems, there are significant structural parallels - in particular, the attempt to think outside the dichotomy of the finite and the infinité, and the attempt to prevent the application of spatio-temporal predicates to the noumenon. The antinomy of représentation for Deleuze is the inability of représentation to think différence apart from as purely representational or as undifferenciated abyss. As we shall see, Deleuze gives an explanation of this antinomy in terms of the differential calculus, and the notion of the differential in particular. While thèse parallels exist between Kant and Deleuze's thought, there are also some important différences. Although the differential is not determined in relation to représentation, this does not mean that it lacks ail détermination. This opens up a possibility not available in Kant's philosophy, that is, a thinking beyond the limit of représentation. As we shall see, Kant closes off this possibility by giving reason a heuristic function which in effect reinstates représentation. Kant makes this move precisely because the lack of spatiotemporal déterminations of the noumenal means for Kant that the noumenal lacks déterminations altogether. (shrink)

This thesis is about the metaphysics of logic. I argue against a view I refer to as ‘logical realism’. This is the view that the logical constants represent a particular kind of metaphysical structure, which I dub ‘logico-metaphysical structure’. I argue instead for a more metaphysically lightweight view of logic which I dub ‘logical expressivism’. -/- In the first part of this thesis (Chapters I and II) I argue against a number of arguments that Theodore Sider has given for logical (...) realism. In Chapter I, I present an argument of his to the effect that logico-metaphysical structure provides the only good explanation of the semantic determinacy of the logical constants. I argue that other explanations are possible. In Chapter II, I present another argument of his to the effect that logico-metaphysical structure is something that comes along with ontological realism: the view that there is a non-language-relative fact of the matter about what exists. I argue that the connection between logical and ontological realism is not as close as Sider makes it out to be. -/- In the second part of this thesis (Chapters III – V) I set out a positive view of the logical constants that can explain both why their meanings are semantically determinate, and why they form part of our vocabulary. On that view, the primary bearers of logical structure are propositional attitudes, and the logical constants are in our language as vehicles for the expression of logically complex propositional attitudes. In Chapter III, I set out an expressivist theory of propositional logic. In Chapter IV, I use this theory to explain how the logical connectives end up having determinate meanings. In Chapter V, I extend the expressivist theory to predicate logic. (shrink)

Possible worlds are commonly seen as an interpretation of modal operators such as "possible" and "necessary". Here, we develop possible world semantics (PWS) which can be expressed in basic set theory and first-order logic, thus offering a reductionist account of modality. Specifically, worlds are understood as complete sets of statements and possible worlds are sets whose statements are consistent with a set of conceptual laws. We introduce the construction calculus (CC), a set of axioms and rules for truth, possibility, (...) worldness and consistency. We show that CC allows to prove fundamental theorems about necessity, possibility, impossibility and contigency, thus demonstrating prima-facie plausibility of PWS. Finally, we discuss the explanatory power of our approach and draw connections between our account and established philosophical conceptions of possible worlds. (shrink)

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)

General Introduction: In [1] a Calculus of Qualia (CQ) was proposed. The key idea is that, for example, blackness is radically different than █. The former term, “blackness” refers to or is about a quale, whereas the latter term, “█” instantiates a quale in the reader’s mind and is non-referential; it does not even refer to itself. The meaning and behavior of these terms is radically different. All of philosophy, from Plato through Descartes through Chalmers, including hieroglyphics and emojis, (...) used referential terms up until CQ. This paper in this series of papers includes a relatively short but comprehensive discussion with the AI Claude 3.5 Sonnet on how the CQ impacts various theories of consciousness, including Materialism, Dualism, Idealism, and 14 others. (shrink)

General Introduction: In [1] a Calculus of Qualia (CQ) was proposed. The key idea is that, for example, blackness is radically different than █. The former term, “blackness” refers to or is about a quale, whereas the latter term, “█” instantiates a quale in the reader’s mind and is non-referential; it does not even refer to itself. The meaning and behavior of these terms is radically different. All of philosophy, from Plato through Descartes through Chalmers, including hieroglyphics and emojis, (...) used referential terms up until CQ. This paper in this series of papers addresses the question of why is there something rather than nothing, at length, and gives a radical new answer. It has to do with the fact in CQ that, while blackness is contingently possible, █ is necessarily actual, as it was in this sentence. (shrink)

According to indexical contextualism, the perspectival element of taste predicates and epistemic modals is part of the content expressed. According to nonindexicalism, the perspectival element must be conceived as a parameter in the circumstance of evaluation, which engenders “thin” or perspective-neutral semantic contents. Echoing Evans, thin contents have frequently been criticized. It is doubtful whether such coarse-grained quasi-propositions can do any meaningful work as objects of propositional attitudes. In this paper, I assess recent responses by Recanati, Kölbel, Lasersohn and MacFarlane (...) to the “incompleteness worry”. None of them manages to convince. Particular attention is devoted to an argument by John MacFarlane, which states that if perspectives must be part of the content, so must worlds, which would make intuitively contingent propositions necessary. I demonstrate that this attempt to defend thin content views such as nonindexical contextualism and relativism conflates two distinct notions of necessity, and that radical indexicalist accounts of semantics, such as Schaffer’s necessitarianism, are in fact quite plausible. (shrink)

In “Value Ascriptions: Rethinking Cognitivism,” Sigrún Svavarsdóttir offers a novel account of the semantic function of evaluative predication, according to which such predicates function as “linguistically encoded classificatory devices.” This short paper raises three questions about Svavarsdóttir’s account: how it relates to familiar sorts of projects in and about semantics, how to understand the nature of “linguistic encoding,” and how to understand the significance of the account’s central use of sets.

In the debate between contextualism and relativism about predicates of taste, the challenge from disagreement (the objection that contextualism cannot account for disagreement in ordinary exchanges involving such predicates) has played a central role. This paper investigates one way of answering the challenge consisting on appeal to certain, less focused on, uses of predicates of taste. It argues that the said thread is unsatisfactory, in that it downplays certain exchanges that constitute the core disagreement data. Additionally, several arguments to the (...) effect that the exchanges in question don’t amount to disagreement are considered and rejected. (shrink)

The derivative is a basic concept of differential calculus. However, if we calculate the derivative as change in distance over change in time, the result at any instant is 0/0, which seems meaningless. Hence, Newton and Leibniz used the limit to determine the derivative. Their method is valid in practice, but it is not easy to intuitively accept. Thus, this article describes the novel method of differential calculus based on the double contradiction, which is easier to accept intuitively. (...) Next, the geometrical meaning of the double contradiction is considered as follows. A tangent at a point on a convex curve is iterated. Then, the slope of the tangent at the point is sandwiched by two kinds of lines. The first kind of line crosses the curve at the original point and a point to the right of it. The second kind of line crosses the curve at the original point and a point to the left of it. Then, the double contradiction can be applied, and the slope of the tangent is determined as a single value. Finally, the meaning of this method for the foundation of mathematics is considered. We reflect on Dehaene’s notion that the foundation of mathematics is based on the intuitions, which evolve independently. Hence, there may be gaps between intuitions. In fact, the Ancient Greeks identified inconsistency between arithmetic and geometry. However, Eudoxus developed the theory of proportion, which is equivalent to the Dedekind Cut. This allows the iteration of an irrational number by rational numbers as precisely as desired. Simultaneously, we can define the irrational number by the double contradiction, although its existence is not guaranteed. Further, an area of a curved figure is iterated and defined by rectilinear figures using the double contradiction. (shrink)

In recent years, the e ffort to formalize erotetic inferences (i.e., inferences to and from questions) has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for these inferences. To fill this lacuna, we construct a calculus for (classes of) sequents that are sound and complete for two species of erotetic inferences studied by Inferential Erotetic Logic (IEL): erotetic evocation and regular erotetic implication. While an attempt has been made (...) to axiomatize the former in a sequent system, there is currently no proof theory for the latter. Moreover, the extant axiomatization of erotetic evocation fails to capture its defeasible character and provides no rules for introducing or eliminating question-forming operators. In contrast, our calculus encodes defeasibility conditions on sequents and provides rules governing the introduction and elimination of erotetic formulas. We demonstrate that an elimination theorem holds for a version of the cut rule that applies to both declarative and erotetic formulas and that the rules for the axiomatic account of question evocation in IEL are admissible in our system. (shrink)

The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic 2Int, which Wansing presents in [2016a]. There he also gives a natural deduction system for this logic, N2Int, to which SC2Int is equivalent in terms of what is derivable. What is important is that these calculi represent a kind of bilateralist (...) reasoning, since they do not only internalize processes of verifcation or provability but also the dual processes in terms of falsifcation or what is called dual provability. In [Wansing, 2017] a normal form theorem for N2Int is stated, here, I want to prove a cut-elimination theorem for SC2Int, i.e., if successful, this would extend the results existing so far. (shrink)

According to contextualism, the extension of claims of personal taste is dependent on the context of utterance. According to truth relativism, their extension depends on the context of assessment. On this view, when the taste preferences of a speaker change, so does the truth value of a previously uttered taste claim, and the speaker might be required to retract it. Both views make strong empirical assumptions, which are here put to the test in three experiments with over 740 participants. It (...) turns out that the linguistic behaviour of ordinary English speakers is consistent with contextualist predictions and inconsistent with the predictions of the most widely discussed form of truth relativism advocated by John MacFarlane. (shrink)

This paper aims to address the difficulties of high school students in bridging their computational understanding with their visualization skills in understanding the notion of the limits in their calculus class. This research used a pre-experimental one-group pretest-posttest design research on 62 grade 10 students enrolled in the Science, Technology, and Engineering Program (STEP) in one of the public high schools in Zamboanga del Sur, Philippines. A series of remedial sessions were given to help them understand the function values, (...) one-sided limits, limits of a function, and its discontinuities with the aid of the GeoGebra. Results revealed that there is a significant improvement in their mathematics performance before and after the remediation, t(61) = -19.99, p<.05. The real-time feedback provided by the drawing interface of GeoGebra has provided the students the insights into how objects behave in geometrical space, bridging their understanding in locating the values shown by the computational algebraic processes. Additionally, the significant difference in the achievement reveals a large effect size (Cohen’s =2.54) which could be accounted for by the remediation using interactive activities in the GeoGebra. (shrink)

Several philosophers have recently appealed to predication in developing their theories of cognitive representation and propositions. One central point of difference between them is whether they take predication to be forceful or neutral and whether they take the most basic cognitive representational act to be judging or entertaining. Both views are supported by powerful reasons and both face problems. Many think that predication must be forceful if it is to explain representation. However, the standard ways of implementing the idea give (...) rise to the Frege-Geach problem. Others think that predication must be neutral, if we’re to avoid the Frege-Geach problem. However, it looks like nothing neutral can explain representation. In this paper I present a third view, one which respects the powerful reasons while avoiding the problems. On this view predication is forceful and can thus explain representation, but the idea is implemented in a novel way, avoiding the Frege-Geach problem. The key is to make sense of the notion of grasping a proposition as an objectual act where the object is a proposition. (shrink)

Despite the wide acceptance of standard modal logic, there has always been a temptation to think that ordinary modal discourse may be correctly analyzed and adequately represented in terms of predicates rather than in terms of operators. The aim of the formal model outlined in this paper is to capture what I take to be the only plausible sense in which ‘possible’ and ‘necessary’ can be treated as predicates. The model is built by enriching the language of standard modal logic (...) with a quantificational apparatus that is “substitutional” rather than “objectual”, and by obtaining from the language so enriched another language in which constants for such predicates apply to singular terms that stand for propositions. (shrink)

Simple sentences containing predicates like "tasty" and "beautiful" typically suggest that the speaker has first-hand knowledge of the item being evaluated. I consider two explanations of this acquaintance inference: a presuppositional approach and a pragmatic-epistemic approach. The presuppositional approach has a number of virtues, but runs into trouble because the acquaintance inference has a very different projection pattern from that of standard presuppositions. The pragmatic-epistemic approach accounts for the main data discussed in the paper, but faces challenges of its own.

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)

This chapter compares simple predicates of personal taste (PPTs) such as tasty and beautiful with their complex counterparts (eg tastes good, looks beautiful). I argue that the former differ from the latter along two dimensions. Firstly, simple PPTs are individual-level predicates, whereas complex ones are stage-level. Secondly, covert Experiencer arguments of simple PPTs obligatorily receive a generic interpretation; by contrast, the covert Experiencer of a complex PPT can receive a generic, bound variable or referential interpretation. I provide an analysis of (...) these facts based on a novel proposal about the licensing of individual-level predicates (the ‘Licensing Condition on ILPs’). This condition states that all covert pronominal arguments of an individual-level predicate must be bound by the generic operator. Finally, I show that generic construal of the Experiencer is a necessary condition for faultless disagreement. This is evidence in favour of treatments of subjective meaning that appeal to genericity, and against relativism about PPTs. (shrink)

In this article I present a disagreement between classical and constructive approaches to predicativity regarding the predicative status of so-called generalised inductive definitions. I begin by offering some motivation for an enquiry in the predicative foundations of constructive mathematics, by looking at contemporary work at the intersection between mathematics and computer science. I then review the background notions and spell out the above-mentioned disagreement between classical and constructive approaches to predicativity. Finally, I look at possible ways of defending the constructive (...) predicativity of inductive definitions. (shrink)

The basic idea is to put qualia into equations (broadly understood) to get what might as well be called qualations. Qualations arguably have different truth behaviors than the analogous equations. Thus ‘black’ has a different behavior than ‘ █ ’. This is a step in the direction of a ‘calculus of qualia’. It might help clarify some issues.

Over the course of the past ten-plus years, Peter Hanks and Scott Soames have developed detailed versions of Act-Based views of propositions which operate with the notions of reference to objects, indicating properties, predication, and judgment (or entertaining). In this paper I discuss certain foundational aspects of the Act-Based approach having to do with the relations between these notions. In particular, I argue for the following three points. First, that the approach needs both an atomistically understood thin notion of reference, (...) a bare act of thinking of o, as well as a more involved notion, something like making o a target of predication. Second, that the acts of thinking of o and indication of the property of being F are in no sense parts of the acts of predication of being F of o and judgment that o is F. Rather, the former are simply necessary preconditions for the performance of the latter. The acts of predication or judgment are emphatically not structured sequences of separate acts but unities in and of themselves. Finally, that we should understand the Act-Based theorists’ claim that to predicate is to judge as the claim that judgment can be reductively analyzed in terms of predication. Furthermore, while predication is metaphysically a multiple relation between a predicator, a target, and the property predicated, judgment is a monadic property, just one that has propositional content. (shrink)

In the sentence “Tom sits,” the name distinguishes Tom from anyone else, whereas the predicate assimilates Tom, Theaetetus, and anyone else to whom the predicate applies. The name marks out its bearer and the predicate groups together what it applies to. On that ground, his name is used to trace back Tom, and the predi- cate is used to describe and classify what it applies to. In both cases, the semantic link is a direct link between expressions (...) and particulars. Here, I will explore the workings of predicative names along the direction just hinted at. The analysis of predication has been less central to philosophical investigation than that of referen- tial expressions. Some problems have concerned the unity of the sentence—what makes us understand “The baby cries” as a sentence rather than a list of words? Other problems have been what a predicate was taken to stand for, properties and relations, and the understanding of either at the ontological level. If a predicate refers to a property or a relation, yet predication, which is central to our understand- ing of predicates, applies it to one or more particulars. On the background hinted at, these problems might be differently viewed. (shrink)

Recently, there’s been a lot of interest in a research program that tries to understand propositional representation in terms of the subject’s performance of sub-propositional mental acts like reference and predication (e. g. Burge 2010, Hanks 2015, Soames 2010, 2015). For example, on one version of the view, for a subject to predicate the property of being a composer of Arvo just is what it is to perform the to the basic propositional act of judging that Arvo is a (...) composer (e. g. Hanks 2015). In this paper I first present my own version of this view and contrast it with alternatives. I then argue that we must clearly separate the thin predication-resultant notion of judging (S(emantic)-judgment) from a much richer notion used in epistemology (E(pistemic)-judgment). The former is just the act of thinking a forceful thought. The latter is the act of making up one’s mind about how things are, a way of concluding theoretical or doxastic deliberation. I argue that these two acts differ in three ways: levels of propositional attitude, objective vs. subjective norms, and the possibility of sub-personal occurrence. (shrink)

The idea of this paper is to put actual qualia into equations (broadly understood) to get what might be called qualations. Qualations arguably have different meanings and truth behaviors than the analogous equations. For example, the term ‘ black ’ arguably has a different meaning and behavior than the term ‘ █ ’. This is a step in the direction of a ‘calculus of qualia’ and of expanding science to include 1st-person phenomena.

This paper argues that truth predicates in natural language and their variants, predicates of correctness, satisfaction and validity, do not apply to propositions (not even with 'that'-clauses), but rather to a range of attitudinal and modal objects. As such natural language reflects a notion of truth that is primarily a normative notion of correctness constitutive of representational objects. The paper moreover argues that 'true' is part of a larger class of satisfaction predicates whose semantic differences are best accounted for in (...) terms of a truthmaker theory along the lines of Fine's recent truthmaker semantics. (shrink)

In this paper we introduce a Gentzen calculus for (a functionally complete variant of) Belnap's logic in which establishing the provability of a sequent in general requires \emph{two} proof trees, one establishing that whenever all premises are true some conclusion is true and one that guarantees the falsity of at least one premise if all conclusions are false. The calculus can also be put to use in proving that one statement \emph{necessarily approximates} another, where necessary approximation is a (...) natural dual of entailment. The calculus, and its tableau variant, not only capture the classical connectives, but also the `information' connectives of four-valued Belnap logics. This answers a question by Avron. (shrink)