A three-valued propositional logic is presented, within which the three values are read as ?true?, ?false? and ?nonsense?. A three-valued extended functional calculus, unrestricted by the theory of types, is then developed. Within the latter system, Bochvar analyzes the Russell paradox and the Grelling-Weyl paradox, formally demonstrating the meaninglessness of both.

This paper introduces new logical systems which axiomatize a formal representation of inconsistency (here taken to be equivalent to contradictoriness) in classical logic. We start from an intuitive semantical account of inconsistent data, fixing some basic requirements, and provide two distinct sound and complete axiomatics for such semantics, LFI1 and LFI2, as well as their first-order extensions, LFI1* and LFI2*, depending on which additional requirements are considered. These formal systems are examples of what we dub Logics of Formal Inconsistency (LFI) (...) and form part of a much larger family of similar logics. We also show that there are translations from classical and paraconsistent first-order logics into LFI1* and LFI2*, and back. Hence, despite their status as subsystems of classical logic, LFI1* and LFI2* can codify any classical or paraconsistent reasoning. (shrink)

In the paper we examine the use of non-classical truth values for dealing with computation errors in program specification and validation. In that context, 3-valued McCarthy logic is suitable for handling lazy sequential computation, while 3-valued Kleene logic can be used for reasoning about parallel computation. If we want to be able to deal with both strategies without distinguishing between them, we combine Kleene and McCarthy logics into a logic based on a non-deterministic, 3-valued matrix, incorporating both options as a (...) non-deterministic choice. If the two strategies are to be distinguished, Kleene and McCarthy logics are combined into a logic based on a 4-valued deterministic matrix featuring two kinds of computation errors which correspond to the two computation strategies described above. For the resulting logics, we provide sound and complete calculi of ordinary, two-valued sequents. (shrink)

The Curry-Howard isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For instance, minimal propositional logic corresponds to simply typed lambda-calculus, first-order logic corresponds to dependent types, second-order logic corresponds to polymorphic types, sequent calculus is related to explicit substitution, etc. The isomorphism has many aspects, even at the syntactic level: formulas correspond to types, proofs correspond to terms, provability corresponds to inhabitation, proof normalization corresponds to (...) term reduction, etc. But there is more to the isomorphism than this. For instance, it is an old idea---due to Brouwer, Kolmogorov, and Heyting---that a constructive proof of an implication is a procedure that transforms proofs of the antecedent into proofs of the succedent; the Curry-Howard isomorphism gives syntactic representations of such procedures. The Curry-Howard isomorphism also provides theoretical foundations for many modern proof-assistant systems (e.g. Coq). This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic. Key features - The Curry-Howard Isomorphism treated as common theme - Reader-friendly introduction to two complementary subjects: Lambda-calculus and constructive logics - Thorough study of the connection between calculi and logics - Elaborate study of classical logics and control operators - Account of dialogue games for classical and intuitionistic logic - Theoretical foundations of computer-assisted reasoning · The Curry-Howard Isomorphism treated as the common theme. · Reader-friendly introduction to two complementary subjects: lambda-calculus and constructive logics · Thorough study of the connection between calculi and logics. · Elaborate study of classical logics and control operators. · Account of dialogue games for classical and intuitionistic logic. · Theoretical foundations of computer-assisted reasoning. (shrink)

This paper offers an explanation of the fact that sentences of the form (1) ‘X may A or B’ may be construed as implying (2) ‘X may A and X may B’, especially if they are used to grant permission. It is suggested that the effect arises because disjunctions are conjunctive lists of epistemic possibilities. Consequently, if the modal may is itself epistemic, (1) comes out as equivalent to (2), due to general laws of epistemic logic. On the other hand, (...) on a deontic reading of may, (2) is only implied under exceptional circumstances – which usually obtain when (1) is used performatively. (shrink)

William Parry conceived in the early thirties a theory of entail-
ment, the theory of analytic implication, intended to give a formal expression to the idea that the content of the conclusion of a valid argument must be included in the content of its premises. This paper introduces a system of analytic, paraconsistent and quasi-classical propositional logic that does not validate the paradoxes of Parry’s analytic implication. The interpretation of the expressions of this logic will be given in terms of a (...) four-valued semantics,and its proof theory will be provided by a system of signed semantic tableaux that incorporates the techniques developed to improve the efficiency of the tableaux method for many-valued logics.
1. Introduction. (shrink)

This book provides the first comprehensive introduction to Dynamic Logic. Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys the singular advantage of being strongly related to classical logic. Its variants constitute natural generalizations and extensions of classical formalisms. For example, Propositional Dynamic Logic (PDL) can be described as a blend of three complementary classical ingredients: propositional calculus, modal logic, and the algebra of regular events. In First-Order Dynamic Logic (DL), the propositional calculus is replaced by classical (...) first-order predicate calculus. Dynamic Logic is a system of remarkable unity that is theoretically rich as well as of practical value. It can be used for formalizing correctness specifications and proving rigorously that those specifications are met by a particular program. Other uses include determining the equivalence of programs, comparing the expressive power of various programming constructs, and synthesizing programs from specifications. This book provides the first comprehensive introduction to Dynamic Logic. It is divided into three parts. The first part reviews the appropriate fundamental concepts of logic and computability theory and can stand alone as an introduction to these topics. The second part discusses PDL and its variants, and the third part discusses DL and its variants. Examples are provided throughout, and exercises and a short historical section are included at the end of each chapter. (shrink)

There is no consensus yet on the definition of semantic information. This paper contributes to the current debate by criticising and revising the Standard Definition of semantic Information (SDI) as meaningful data, in favour of the Dretske‐Grice approach: meaningful and well‐formed data constitute semantic information only if they also qualify as contingently truthful. After a brief introduction, SDI is criticised for providing necessary but insufficient conditions for the definition of semantic information. SDI is incorrect because truth‐values do not supervene on (...) semantic information, and misinformation (that is, false semantic information) is not a type of semantic information, but pseudo‐information, that is not semantic information at all. This is shown by arguing that none of the reasons for interpreting misinformation as a type of semantic information is convincing, whilst there are compelling reasons to treat it as pseudo‐information. As a consequence, SDI is revised to include a necessary truth‐condition. The last section summarises the main results of the paper and indicates some interesting areas of application of the revised definition. (shrink)

The subsystem S of Parry's AI [10] (obtained by omitting modus ponens for the material conditional) is axiomatized and shown to be strongly complete for a class of three valued Kripke style models. It is proved that S is weakly complete for the class of consistent models, and therefore that Ackermann's rule is admissible in S. It also happens that S is decidable and contains the Lewis system S4 on translation — though these results are not presented here. S is (...) arguably the most relevant relevant logic known at this time to be decidable. (shrink)

This book introduces an important group of logics that have come to be known under the umbrella term 'susbstructural'. Substructural logics have independently led to significant developments in philosophy, computing and linguistics. _An Introduction to Substrucural Logics_ is the first book to systematically survey the new results and the significant impact that this class of logics has had on a wide range of fields.The following topics are covered: * Proof Theory * Propositional Structures * Frames * Decidability * Coda Both (...) students and professors of philosophy, computing, linguistics, and mathematics will find this to be an important addition to their reading. (shrink)

In spite of a powerful tradition, more than two thousand years old, that in a valid argument the premises must be relevant to the conclusion, twentieth-century logicians neglected the concept of relevance until the publication of Volume I of this monumental work. Since that time relevance logic has achieved an important place in the field of philosophy: Volume II of Entailment brings to a conclusion a powerful and authoritative presentation of the subject by most of the top people working in (...) the area. Originally the aim of Volume II was simply to cover certain topics not treated in the first volume--quantification, for example--or to extend the coverage of certain topics, such as semantics. However, because of the technical progress that has occurred since the publication of the first volume, Volume II now includes other material. The book contains the work of Alasdair Urquhart, who has shown that the principal sentential systems of relevance logic are undecidable, and of Kit Fine, who has demonstrated that, although the first-order systems are incomplete with respect to the conjectured constant domain semantics, they are still complete with respect to a semantics based on "arbitrary objects." Also presented is important work by the other contributing authors, who are Daniel Cohen, Steven Giambrone, Dorothy L. Grover, Anil Gupta, Glen Helman, Errol P. Martin, Michael A. McRobbie, and Stuart Shapiro. Robert G. Wolf's bibliography of 3000 items is a valuable addition to the volume. (shrink)

One approach to the paradoxes of self-referential languages is to allow some sentences to lack a truth value (or to have more than one). Then assigning truth values where possible becomes a fixpoint construction and, following Kripke, this is usually carried out over a partially ordered family of three-valued truth-value assignments. Some years ago Matt Ginsberg introduced the notion of bilattice, with applications to artificial intelligence in mind. Bilattices generalize the structure Kripke used in a very natural way, while making (...) the mathematical machinery simpler and more perspicuous. In addition, work such as that of Yablo fits naturally into the bilattice setting. What I do here is present the general background of bilattices, discuss why they are natural, and show how fixpoint approaches to truth in languages that allow self-reference can be applied. This is not new work, but rather is a summary of research I have done over many years. (shrink)

In early Buddhist logic, it was standard to assume that for any state of a ff airs there were four possibilities: that it held, that it did not, both, or neither. This is the catuskoti (or tetralemma). Classical logicians have had a hard time mak­ing sense of this, but it makes perfectly good sense in the se­mantics of various paraconsistent logics, such as First Degree Entailment. Matters are more complicated for later Buddhist thinkers, such as Nagarjuna, who appear to suggest (...) that none of these options , or more than one, may hold. The point of this paper is to examine the matter, including the formal logical machinery that may be appropriate. (shrink)