I shall elaborate more on the idea of anti-irrationalism proposed by the Polish analytic philosopher Kazimierz Ajdukiewicz, a prominent member of the Lvov-Warsaw School of philosophy and logic. In my reading, anti-irrationalism stands in opposition not only to overt irrationalism, which is made clear by the term itself, but also to all forms of rationalism that tip toward something like worship of reason. Having characterized anti-irrationalism as it originally appeared in Ajdukiewicz’s works, I shall propose a certain reformulation of it, (...) so as to capture a broader philosophical legacy in Poland, primarily, yet not exclusively the Lvov-Warsaw School. (shrink)

The Church-Turing Thesis (CTT) is often paraphrased as ``every computable function is computable by means of a Turing machine.'' The author has constructed a family of equational theories that are not Turing-decidable, that is, given one of the theories, no Turing machine can recognize whether an arbitrary equation is in the theory or not. But the theory is called pseudorecursive because it has the additional property that when attention is limited to equations with a bounded number of variables, one obtains, (...) for each number of variables, a fragment of the theory that is indeed Turing-decidable. In a 1982 conversation, Alfred Tarski announced that he believed the theory to be decidable, despite this contradicting CTT. The article gives the background for this proclamation, considers alternate interpretations, and sets the stage for further research. (shrink)

Our relationship to the infinite is controversial. But it is widely agreed that our powers of reasoning are finite. I disagree with this consensus; I think that we can, and perhaps do, engage in infinite reasoning. Many think it is just obvious that we can't reason infinitely. This is mistaken. Infinite reasoning does not require constructing infinitely long proofs, nor would it gift us with non-recursive mental powers. To reason infinitely we only need an ability to perform infinite inferences. I (...) argue that we have this ability. My argument looks to our best current theories of inference and considers examples of apparent infinite reasoning. My position is controversial, but if I'm right, our theories of truth, mathematics, and beyond could be transformed. And even if I'm wrong, a more careful consideration of infinite reasoning can only deepen our understanding of thinking and reasoning. -/- (Note for readers: the paper's brief discussion of uniform reflection and omega inconsistency is misleading. The imagined interlocutor's argument makes an assumption about the PA-provability of provability generalizations that, while true for the Godel sentence's instances, is unjustified, in general. This means my position is stronger against this objection than the paper suggests, since omega inconsistent theories are not automatically inconsistent with their uniform reflection principles, you also need to assume the arithmetically true Pi-2 sentences.). (shrink)

Proof-theoretic semantics is an alternative to model-theoretic semantics. It aims at explaining the meaning of the logical constants in terms of the inference rules that govern their behaviour in proofs. We argue that this must be construed as the task of explaining these meanings relative to a logic, i.e., to a consequence relation. Alas, there is no agreed set of properties that a relation must have in order to qualify as a consequence relation. Moreover, the association of a consequence relation (...) to a logical calculus is not as straightforward as it may seem. We show that these facts are problematic for the proof-theoretic project but the problems can be solved. Our thesis is that the consequence relation relevant for proof-theoretic semantics is the one given by the sequent-to-sequent derivability relation in Gentzen systems. (shrink)

Paul Horwich is aware of the fact that his theory as stated in his works is directly applicable only to a language in which a word, understood as a syntactic type, is connected with exactly one literal meaning. Yet he claims that the theory is expandable to include homonymy and indexicality and thus may be considered as applicable to natural language. My concern in this paper is with yet another kind of ambiguity—systematic polysemy—that assigns multiple meanings to one linguistic type. (...) I want to combine the characteristics of systematic polysemy with the Kaplanian insight that meanings of expressions may be defined by semantic rules which assign content in context and to ask the question if minimalism about truth and meaning is compatible with such rule-based systematic polysemy. I will first explain why the expressions that exhibit rule-based systematic polysemy are difficult to combine with a truth theory that is based on a use theory of meaning before proceeding to argue that indexicals and proper names are such expressions. (shrink)

A dialectical contradiction can be appropriately described within the framework of classical formal logic. It is in harmony with the law of noncontradiction. According to our definition, two theories make up a dialectical contradiction if each of them is consistent and their union is inconsistent. It can happen that each of these two theories has an intended model. Plenty of examples are to be found in the history of science.

A relativized version of Tarski's T-scheme is introduced as a new principle of the truth predicate. Under the relativized T-scheme, the paradoxical objects, such as the Liar sentence and Jourdain's card sequence, are found to have certain relative contradictoriness. That is, they are contradictory only in some frames in the sense that any valuation admissible for them in these frames will lead to a contradiction. It is proved that for any positive integer n, the n-jump liar sentence is contradictory in (...) and only in those frames containing at least an n-jump odd cycle. In particular, the Liar sentence is contradictory in and only in those frames containing at least an odd cycle. The Liar sentence is also proved to be less contradictory than Jourdain's card sequence: the latter must be contradictory in those frames where the former is so, but not vice versa. Generally, the relative contradictoriness is the common characteristic of the paradoxical objects, but different paradoxical objects may have different relative contradictoriness. (shrink)

According to the interpretational theory of logical validity (IR), logical validity is preservation of truth in all interpretations compatible with the intended meaning of logical expressions. IR suffers from a seemingly defeating objection, the so-called cardinality problem: any instance of the statement ‘There are n things’ is true under all interpretations, since it can be written down using only logical expressions that are not to be reinterpreted; yet ‘There are n things’ is not logically true. I argue that the cardinality (...) problem is indeed a serious problem for IR, when understood in terms of ‘asymmetry of information’. I then argue that IR can be rehabilitated by making quantifiers context-sensitive: what we do not reinterpret is the Kaplanian character of a quantifier, rather than its content. ‘There are n things’ is false in a context where fewer than n things are relevant, so it is not logically true in IR. I finally discuss some objections and ramifications of my account: I discuss how to make space for the possibility of an explicitly absolutely general quantifier in my framework, how terms can be logical even though context-sensitive, and how to recapture classical logic within my framework. (shrink)

Tarski's theory of truth brings out the question of whether he intended his theory to be a correspondence theory of truth and whether, whatever his intentions, his theory is in fact a correspondence theory. The aim of this paper is to answer both questions. The answer to the first question depends on Tarski's relevant assertions on semantics and his conception of truth. In order to answer the second question Popper's and Davidson's interpretations of Tarski's truth theory are examined; to this (...) end both Tarski's definition of truth in terms of satisfaction and the T-sentences are taken into account. (shrink)

In section 1, I develop epistemic communism, my view of the function of epistemically evaluative terms such as ‘rational’. The function is to support the coordination of our belief-forming rules, which in turn supports the reliable acquisition of beliefs through testimony. This view is motivated by the existence of valid inferences that we hesitate to call rational. I defend the view against the worry that it fails to account for a function of evaluations within first-personal deliberation. In the rest of (...) the paper, I then argue, on the basis of epistemic communism, for a view about rationality itself. I set up the argument in section 2 by saying what a theory of rational deduction is supposed to do. I claim that such a theory would provide a necessary, sufficient, and explanatorily unifying condition for being a rational rule for inferring deductive consequences. I argue in section 3 that, given epistemic communism and the conventionality that it entails, there is no such theory. Nothing explains why certain rules for deductive reasoning are rational. (shrink)

Intra-theoretical logical pluralism is a form of meaning-invariant pluralism about logic, articulated recently by Hjortland :355–373, 2013). This version of pluralism relies on it being possible to define several distinct notions of provability relative to the same logical calculus. The present paper picks up and explores this theme: How can a single logical calculus express several different consequence relations? The main hypothesis articulated here is that the divide between the internal and external consequence relations in Gentzen systems generates a form (...) of intra-theoretical logical pluralism. (shrink)

Proof-theoretic semantics is an alternative to model-theoretic semantics. It aims at explaining the meaning of the logical constants in terms of the inference rules that govern their behaviour in proofs. We argue that this must be construed as the task of explaining these meanings relative to a logic, i.e., to a consequence relation. Alas, there is no agreed set of properties that a relation must have in order to qualify as a consequence relation. Moreover, the association of a consequence relation (...) to a logical calculus is not as straightforward as it may seem. We show that these facts are problematic for the proof-theoretic project but the problems can be solved. Our thesis is that the consequence relation relevant for proof-theoretic semantics is the one given by the sequent-to-sequent derivability relation in Gentzen systems. (shrink)

Logical nihilism is the view that the relation of logical consequence is empty: there are counterexamples to any putative logical law. In this paper, I argue that the nihilist threat is illusory. The nihilistic arguments do not work. Moreover, the entire project is based on a misguided interpretation of the generality of logic.

In the original publication of the article, in Definition 4, the sixth line which reads as.

On a bilateralist reading, sequents are interpreted as statements to the effect that, given the assertion of the antecedent it is incoherent to deny the succedent. This interpretation goes against its own ecumenical ambitions, endowing Cut with a meaning very close to that of tertium non datur and thus rendering it intuitionistically unpalatable. This paper explores a top-down route for arguing that, even intuitionistically, a prohibition to deny is as strong as a licence to assert.

Proof-theoretic reflection principles are schemas which attempt to express the soundness of arithmetical theories within their own language, e.g., ${\mathtt{{Prov}_{\mathsf {PA}} \rightarrow \varphi }}$ can be understood to assert that any statement provable in Peano arithmetic is true. It has been repeatedly suggested that justification for such principles follows directly from acceptance of an arithmetical theory $\mathsf {T}$ or indirectly in virtue of their derivability in certain truth-theoretic extensions thereof. This paper challenges this consensus by exploring relationships between reflection principles (...) and principles of mathematical and transfinite induction as well as the status of the latter with respect to various foundational characterizations of number theory. (shrink)

We extend the Embracing Revenge account of the semantic paradoxes by constructing two distinct consequence relations that reflect, in different ways, the transfinitely-many-valued semantics developed in earlier work. In particular, we adapt the underlying ideas of “gappy” approaches based on K3, and “glutty” approaches based on LP, to the Embracing Revenge framework, by treating the infinitely many non-classical truth values as infinitely many ways that a sentence might fail to receive a classical truth value in the former case, and as (...) infinitely many ways that a sentence might receive both classical truth values in the latter. In order to obtain deductive systems that are very nearly classical, we need to utilize different conditionals (and different negations) in each logic. (shrink)

In this paper I will address the question of rationalizing mental causation which is involved in the processes of epistemic justification. The main problem concerning mental causation consists in the apparent incompatibility of the three following claims: (i) the subject's mental states (in particular his belief states) are realized by neural states of the subject's brain; (ii) the justifying character of belief transition consists in the fact that there are certain broadly logical relations between the contents of the relevant beliefs; (...) and (iii) all generations of neural states are, at bottom, governed by the purely physical laws. I try to reconciliate the physical necessity of the neural states generation with the logical rationality of the belief transition. Surprisingly enough, it will turn out that, in a sense, each thinking subject is logically perfect. However, in another sense we are exactly as fallible and irrational as our common-sense tells us. (shrink)

Though it''s difficult to agree on the exact date of their union, logic and artificial intelligence (AI) were married by the late 1950s, and, at least during their honeymoon, were happily united. What connubial permutation do logic and AI find themselves in now? Are they still (happily) married? Are they divorced? Or are they only separated, both still keeping alive the promise of a future in which the old magic is rekindled? This paper is an attempt to answer these questions (...) via a review of six books. Encapsulated, our answer is that (i) logic and AI, despite tabloidish reports to the contrary, still enjoy matrimonial bliss, and (ii) only their future robotic offspring (as opposed to the children of connectionist AI) will mark real progress in the attempt to understand cognition. (shrink)

This paper argues that there are three reasons why we should regard Wittgenstein's Tractatus as a forerunner of formal semantics: Wittgenstein is convinced that we can apply formal notions to natur...

-/- A schema (plural: schemata, or schemas), also known as a scheme (plural: schemes), is a linguistic template or pattern together with a rule for using it to specify a potentially infinite multitude of phrases, sentences, or arguments, which are called instances of the schema. Schemas are used in logic to specify rules of inference, in mathematics to describe theories with infinitely many axioms, and in semantics to give adequacy conditions for definitions of truth. -/- 1. What is a Schema? (...) 2. Uses of Schemas 3. The Ontological Status of Schemas 4. Schemas in the History of Logic Bibliography. (shrink)

A good argument is one whose conclusions follow from its premises; its conclusions are consequences of its premises. But in what sense do conclusions follow from premises? What is it for a conclusion to be a consequence of premises? Those questions, in many respects, are at the heart of logic (as a philosophical discipline). Consider the following argument: 1. If we charge high fees for university, only the rich will enroll. We charge high fees for university. Therefore, only the rich (...) will enroll. There are many different things one can say about this argument, but many agree that if we do not equivocate (if the terms mean the same thing in the premises and the conclusion) then the argument is valid, that is, the conclusion follows deductively from the premises. This does not mean that the conclusion is true. Perhaps the premises are not true. However, if the premises are true, then the conclusion is also true, as a matter of logic. This entry is about the relation between premises and conclusions in valid arguments. (shrink)

Corcoran, J. 2007. Syntactics, American Philosophy: an Encyclopedia. 2007. Eds. John Lachs and Robert Talisse. New York: Routledge. pp.745-6. -/- Syntactics, semantics, and pragmatics are the three levels of investigation into semiotics, or the comprehensive study of systems of communication, as described in 1938 by the American philosopher Charles Morris (1903-1979). Syntactics studies signs themselves and their interrelations in abstraction from their meanings and from their uses and users. Semantics studies signs in relation to their meanings, but still in abstraction (...) from their uses and users. Pragmatics studies signs as meaningful entities used in various ways by humans. Taking current written English as the system of communication under investigation, it is a matter of syntactics that the two four-character strings ‘tact’ and ‘tics’ both occur in the ten-character string ‘syntactics’. It is a matter of semantics that the ten-character string ‘syntactics’ has only one sense and, in that sense, it denotes a branch of semiotics. It is a matter of pragmatics that the ten-character string ‘syntactics’ was not used as an English word before 1937 and that it is sometimes confused with the much older six-character string ‘syntax’. Syntactics is the simplest and most abstract branch of semiotics. At the same time, it is the most basic. Pragmatics presupposes semantics and syntactics; semantics presupposes syntactics. The basic terms of syntactics include the following: ‘character’ as alphabetic letters, numeric digits, and punctuation marks; ‘string’ as sign composed of a concatenation of characters; ‘occur’ as ‘t’ and ‘c’ both occur twice in ‘syntactics’. However, perhaps the most basic terms of syntactics are ‘type’ and ‘token’ in the senses introduced by Charles Sanders Peirce (1839-1914), America’s greatest logician, who could be considered the grandfather of syntactics, if not the father. These are explained below. (shrink)

Symbolic logic is sited at intersection of philosophy, mathematics, linguistics and computer science. It deals with the structure of reasoning, and the formal features of information. Work in symbolic logic has almost exclusively treated the deductive validity of arguments: those arguments for which it is impossible for the premises to be true and the conclusion false. However, techniques from twentieth-century logic have found a place in the study of inductive or probabilistic reasoning, in which premises need not render their conclusions (...) certain. (shrink)

Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...) foundations of mathematics and in relation to philosophical motivations leading to the development of intuitionistic logic. This sets the stage for a brief description of the relevant part of Dummett’s program to recast debates in metaphysics, and in particular disputes about realism and anti-realism, as closely intertwined with issues in philosophical logic, with the acceptance of classical logic for a domain reflecting a commitment to realism for that domain. Then I review extant results about what is provable and what is not when one adds epsilon to intuitionistic logic, largely due to Bell and DeVidi, and I give several new proofs of intermediate logics from intuitionistic logic+ε without identity. With all this in hand, I turn to a discussion of the philosophical significance of choice operators. Among the conclusions I defend are that these results provide a finer-grained basis for Dummett’s contention that commitment to classically valid but intuitionistically invalid principles reflect metaphysical commitments by showing those principles to be derivable from certain existence assumptions; that Dummett’s framework is improved by these results as they show that questions of realism and anti-realism are not an “all or nothing” matter, but that there are plausibly metaphysical stances between the poles of anti-realism and realism, because different sorts of ontological assumptions yield intermediate rather than classical logic; and that these intermediate positions between classical and intuitionistic logic link up in interesting ways with our intuitions about issues of objectivity and reality, and do so usefully by linking to questions around intriguing everyday concepts such as “is smart,” which I suggest involve a number of distinct dimensions which might themselves be objective, but because of their multivalent structure are themselves intermediate between being objective and not. Finally, I discuss the implications of these results for ongoing debates about the status of arbitrary and ideal objects in the foundations of logic, showing among other things that much of the discussion is flawed because it does not recognize the degree to which the claims being made depend on the presumption that one is working with a very strong logic. (shrink)

I proffer a success argument for classical logical consequence. I articulate in what sense that notion of consequence should be regarded as the privileged notion for metaphysical inquiry aimed at uncovering the fundamental nature of the world. Classical logic breeds necessitism. I use necessitism to produce problems for both ontological naturalism and atheism.

The aim of this paper is to show that the account of objective truth taken for granted by logicians at least since the publication in 1933 of Tarski’s “The Concept of Truth in Formalized Languages” arose out of a tradition of philosophical thinking initiated by Bolzano and Brentano. The paper shows more specifically that certain investigations of states of affairs and other objectual correlates of judging acts, investigations carried out by Austrian and Polish philosophers around the turn of the century, (...) formed part of the background of views that led to standard current accounts of the objectivity of truth. It thus lends support to speculations on the role of Brentano and his heirs in contemporary logical philosophy advanced by Jan Wolenski in his masterpiece of 1989 on the Logic and philosophy in the Lvov-Warsaw School. (shrink)

I discuss some questions of quantum physics, for instance the validity and limitations of the basic language of set theory to deal with problems related to elementary particles. I also present a sketch of a formalization of a “metaphysics of structures”, which might be useful for a kind of “ontic structural realism”, and briefly review the concept of quasi-truth, which underlies my way of understanding scientific theories and the scientific activity.