There are various ways of achieving an enlarged understanding of a concept of interest. One way is by giving its proper definition. Another is by giving something else a proper definition and then using it to model or formally represent the original concept. Between the two we find varying shades of grey. We might open up a concept by a direct lexical definition of the predicate that expresses it, or by a theory whose theorems define it implicitly. At the other (...) end of the spectrum, the modelling-this-as-that option also admits of like variation, ranging from models rooted in formal representability theorems to models conceived of as having only heuristic value. There exist on both sides of this divide further differences still. In one of them, both the definiendum and definiens of a definition are words or phrases of some common natural language. In others, the item of interest is a natural language expression and its representation is furnished by the artificial linguistic system that models it. The modern history of these approaches is both very large and growing. Much of this evolution has given too short a shrift to the history of the demotion of ‘intuitive’ concepts in favour of the artificially contrived ones intended to model them. A working assumption of this article is that in the absence of a good understanding of what motivated the modelling-turn in the foundations of mathematics and the intuitive theory of truth, the whole notion of formal representability will have been inadequately understood. In the interests of space, I will concentrate on seminal issues in set theory as dealt with by Russell and Frege, and in the theory of truth in natural languages as dealt with by Tarski. The nub of the present focus is the representational role of model theory in the logics of formalized languages. (shrink)

The general aim of this book is to provide an elementary exposition of some basic concepts in terms of which both classical and non-dassicallogirs may be studied and appraised. Although quantificational logic is dealt with briefly in the last chapter, the discussion is chiefly concemed with propo gjtional cakuli. Still, the subject, as it stands today, cannot br covered in one book of reasonable length. Rather than to try to include in the volume as much as possible, I have put (...) emphasis on some selected topics. Even these could not be roverrd completely, but for each topic I have attempted to present a detailed and precise t’Xposition of several basic results including some which are non-trivial. The roots of some of the central ideas in the volume go back to J. Luka siewicz’s seminar on mathematicallogi. (shrink)

By a `denoting phrase' I mean a phrase such as any one of the following: a man, some man, any man, every man, all men, the present King of England, the present King of France, the center of mass of the solar system at the first instant of the twentieth century, the revolution of the earth round the sun, the revolution of the sun round the earth. Thus a phrase is denoting solely in virtue of its form. We may distinguish (...) three cases: (1) A phrase may be denoting, and yet not denote anything; e.g., `the present King of France'. (2) A phrase may denote one definite object; e.g., `the present King of England' denotes a certain man. (3) A phrase may denote ambiguously; e.g. `a man' denotes not many men, but an ambiguous man. The interpretation of such phrases is a matter of considerably difficulty; indeed, it is very hard to frame any theory not susceptible of formal refutation. All the difficulties with which I am acquainted are met, so far as I can discover, by the theory which I am about to explain. (shrink)

ABSTRACTA conditional is natural if it fulfils the three following conditions. It coincides with the classical conditional when restricted to the classical values T and F; it satisfies the Modus Ponens; and it is assigned a designated value whenever the value assigned to its antecedent is less than or equal to the value assigned to its consequent. The aim of this paper is to provide a ‘bivalent’ Belnap-Dunn semantics for all natural implicative expansions of Kleene's strong 3-valued matrix with two (...) designated elements. (shrink)

A classical result by Słupecki states that a logic L is functionally complete for the 3-element set of truth-values THREE if, in addition to functionally including Łukasiewicz’s 3-valued logic Ł3, what he names the ‘$T$-function’ is definable in L. By leaning upon this classical result, we prove a general theorem for defining binary expansions of Kleene’s strong logic that are functionally complete for THREE.

In this paper we prove the following theorem: Any one-dimensional definably connected group G over an o-minimal structure is, as an abstract group, isomorphic to either pPp∞δ or δ.

In this introduction to the special issue “40 years of FDE”, we offer an overview of the field and put the papers included in the special issue into perspective. More specifically, we first present various semantics and proof systems for FDE, and then survey some expansions of FDE by adding various operators starting with constants. We then turn to unary and binary connectives, which are classified in a systematic manner. First-order FDE is also briefly revisited, and we conclude by listing (...) some open problems for future research. (shrink)

A typical theorem of conaexive logics is Aristotle''s Thesis(A), (AA).A cannot be added to classical logic without producing a trivial (Post-inconsistent) logic, so connexive logics typically give up one or more of the classical properties of conjunction, e.g.(A & B)A, and are thereby able to achieve not only nontriviality, but also (negation) consistency. To date, semantical modellings forA have been unintuitive. One task of this paper is to give a more intuitive modelling forA in consistent logics. In addition, while inconsistent (...) but nontrivial theories, and inconsistent nontrivial logics employing prepositional constants (for which the rule of uniform substitution US fails), have both been studied extensively within the paraconsistent programme, inconsistent nontrivial logics (closed under US) do not seem to have been. This paper gives sufficient conditions for a logic containingA to be inconsistent, and then shows that there is a class of inconsistent nontrivial logics all containingA. A second semantical modelling forA in such logics is given. Finally, some informal remarks about the kind of modellingA seems to require are made. (shrink)

The aim of this paper is to introduce an alternative to Łukasiewicz’s 4-valued modal logic Ł. As it is known, Ł is afflicted by “Łukasiewicz type paradoxes”. The logic we define, PŁ4, is a strong paraconsistent and paracomplete 4-valued modal logic free from this type of paradoxes. PŁ4 is determined by the degree of truth-preserving consequence relation defined on the ordered set of values of a modification of the matrix MŁ characteristic for the logic Ł. On the other hand, PŁ4 (...) is a rich logic in which a number of connectives can be defined. It also has a simple bivalent semantics of the Belnap–Dunn type. (shrink)

A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.

Taking our inspiration from modal correspondence theory, we present the idea of correspondence analysis for many-valued logics. As a benchmark case, we study truth-functional extensions of the Logic of Paradox (LP). First, we characterize each of the possible truth table entries for unary and binary operators that could be added to LP by an inference scheme. Second, we define a class of natural deduction systems on the basis of these characterizing inference schemes and a natural deduction system for LP. Third, (...) we show that each of the resulting natural deduction systems is sound and complete with respect to its particular semantics. (shrink)

Stephen Cole Kleene was one of the greatest logicians of the twentieth century and this book is the influential textbook he wrote to teach the subject to the next generation. It was first published in 1952, some twenty years after the publication of Godel's paper on the incompleteness of arithmetic, which marked, if not the beginning of modern logic. The 1930s was a time of creativity and ferment in the subject, when the notion of computable moved from the realm of (...) philosophical speculation to the realm of science. This was accomplished by the work of Kurt Gode1, Alan Turing, and Alonzo Church, who gave three apparently different precise definitions of computable. When they all turned out to be equivalent, there was a collective realization that this was indeed the right notion. Kleene played a key role in this process. One could say that he was there at the beginning of modern logic. He showed the equivalence of lambda calculus with Turing machines and with Godel's recursion equations, and developed the modern machinery of partial recursive functions. This textbook played an invaluable part in educating the logicians of the present. It played an important role in their own logical education.". (shrink)

In the Grundlagen , Frege offers eight main arguments, together with a series of more minor supporting arguments, against Mill’s view that numbers are “properties of external things”. This paper reviews all eight of these arguments, arguing that none are conclusive.

Only propositional logics are at issue here. Such a logic is contra-classical in a superficial sense if it is not a sublogic of classical logic, and in a deeper sense, if there is no way of translating its connectives, the result of which translation gives a sublogic of classical logic. After some motivating examples, we investigate the incidence of contra-classicality (in the deeper sense) in various logical frameworks. In Sections 3 and 4 we will encounter, originally as an example of (...) what (in Section 2) we call a contra-classical modal logic, an unusual logic boasting a connective (" demi-negation" ) whose double application is equivalent to a single application of the negation connective. Pondering the example points the way to a general characterization of contra-classicality (Theorems 3.3 and 4.6). In an Appendix (Section 5), we look at one alternative to classical logic as the target for such translational assimilation, intuitionistic logic, calling logics which resist the assimilation, in this case, contra- intuitionistic. We will show that one such logic is classical logic itself, thereby strengthening a result of Wojcicki's to the effect that the consequence relation of classical logic cannot be faithfully embedded by any connective-by-connective translation into that of intuitionistic logic. (What the "faithfully" means here is that not only is the translation of anything provable in the 'source' logic.. (shrink)

Introduction to this special issue of The Australasian Journal of Logic.

Logic isn’t special. Its theories are continuous with science; its method continuous with scientific method. Logic isn’t a priori, nor are its truths analytic truths. Logical theories are revisable, and if they are revised, they are revised on the same grounds as scientific theories. These are the tenets of anti-exceptionalism about logic. The position is most famously defended by Quine, but has more recent advocates in Maddy, Priest, Russell, and Williamson. Although these authors agree on many methodological issues about logic, (...) they disagree about which logic anti-exceptionalism supports. Williamson uses an anti-exceptionalist argument to defend classical logic, while Priest claims that his anti-exceptionalism supports nonclassical logic. This paper argues that the disagreement is due to a difference in how the parties understand logical theories. Once we reject Williamson’s deflationary account of logical theories, the argument for classical logic is undercut. Instead an alternative account of logical theories is offered, on which logical pluralism is a plausible supplement to anti-exceptionalism. (shrink)

‘I proceed. ‘Edwin and Morcar, the earls of Mercia and Northumbria, declared for him: and even Stigand, the patriotic archbishop of Canterbury, found it advisable—”’ ‘Found what?” said the Duck. ‘Found it’ the Mouse replied rather crossly: ‘of course you know what “it” means.’ ‘I know what “it” means well enough, when I find a thing’, said the Duck: ‘it's generally a frog or a worm. The question is, what did the archbishop find?’.

This paper explores allowing truth value assignments to be undetermined or "partial" and overdetermined or "inconsistent", thus returning to an investigation of the four-valued semantics that I initiated in the sixties. I examine some natural consequence relations and show how they are related to existing logics, including ukasiewicz's three-valued logic, Kleene's three-valued logic, Anderson and Belnap's relevant entailments, Priest's "Logic of Paradox", and the first-degree fragment of the Dunn-McCall system "R-mingle". None of these systems have nested implications, and I investigate (...) twelve natural extensions containing nested implications, all of which can be viewed as coming from natural variations on Kripke's semantics for intuitionistic logic. Many of these logics exist antecedently in the literature, in particular Nelson 's "constructible falsity". (shrink)

A characterization of groups definable in o-minimal structures having maximal definable definably compact subgroups is given. This follows from a definable decomposition in analogy with Lie groups, where the role of maximal tori is played by maximal 0-subgroups. Along the way we give structural theorems for solvable groups, linear groups, and extensions of definably compact by torsion-free definable groups.

We outline a neo-Meinongian framework labeled as Modal Meinongian Metaphysics (MMM) to account for the ontology and semantics of fictional discourse. Several competing accounts of fictional objects are originated by the fact that our talking of them mirrors incoherent intuitions: mainstream theories of fiction privilege some such intuitions, but are forced to account for others via complicated paraphrases of the relevant sentences. An ideal theory should resort to as few paraphrases as possible. In Sect. 1, we make this explicit via (...) two methodological principles, called the Minimal Revision and the Acceptability Constraint. In Sect. 2, we introduce the standard distinction between internal and external fictional discourse. In Sects. 3–5, we discuss the approaches of (traditional) Meinongianism, Fictionalism, and Realism—and their main troubles. In Sect. 6 we propose our MMM approach. This is based upon (1) a modal semantics including impossible worlds (Subsect. 6.1); (2) a qualified Comprehension Principle for objects (Subsect. 6.2); (3) a notion of existence-entailment for properties (Subsect. 6.3). In Sect. 7 we present a formal semantics for MMM based upon a representation operator. And in Sect. 8 we have a look at how MMM solves the problems of the three aforementioned theories. (shrink)

. The paper presents a method for transforming a given sound and complete n-sequent proof system into an equivalent sound and complete system of ordinary sequents. The method is applicable to a large, central class of (generalized) finite-valued logics with the language satisfying a certain minimal expressiveness condition. The expressiveness condition decrees that the truth-value of any formula φ must be identifiable by determining whether certain formulas uniformly constructed from φ have designated values or not. The transformation preserves the general (...) structure of proofs in the original calculus in a way ensuring preservation of the weak cut elimination theorem under the transformation. The described transformation metod is illustrated on several concrete examples of many-valued logics, including a new application to information sources logics. (shrink)

By recent work on some conjectures of Pillay, each definably compact group G in a saturated o-minimal expansion of an ordered field has a normal "infinitesimal subgroup" G00 such that the quotient G/G00, equipped with the "logic topology", is a compact (real) Lie group. Our first result is that the functor G → G/G00 sends exact sequences of definably compact groups into exact sequences of Lie groups. We then study the connections between the Lie group G/G00 and the o-minimal spectrum (...) G̃ of G. We prove that G/G00 is a topological quotient of G̃. We thus obtain a natural homomorphism ψ* from the cohomology of G/G00 to the (Čech-)cohomology of G̃. We show that if G00 satisfies a suitable contractibility conjecture then $\widetilde{G^{00}}$ is acyclic in Čech cohomology and ψ* is an isomorphism. Finally we prove the conjecture in some special cases. (shrink)

Impossible Worlds focuses on an exciting new theory in philosophy, with applications in metaphysics, logic, and the theory of meaning. Its central topic is: how do we meaningfully talk and reason about situations which, unbeknownst to us, are impossible? This issue emerges as a central problem in contemporary philosophical accounts of meaning, information, knowledge, belief, fiction, conditionality, and counterfactual supposition. The book is written bytwo of the leading philosophers in the area and contains original research of relevance to professional philosophers (...) and logicians working in metaphysics, philosophy of language, formal logic, and adjacentareas. (shrink)

Kleene’s well-known strong three-valued logic is shown to be one of a family of logics with similar mathematical properties. These logics are produced by an intuitively natural construction. The resulting logics have direct relationships with bilattices. In addition they possess mathematical features that lend themselves well to semantical constructions based on fixpoint procedures, as in logic programming.