Goal-directed proof theory

This report is the draft of a book about goal directed proof theoretical formulations of non-classical logics. It evolved from a response to the existence of two camps in the applied logic (computer science/artificial intelligence) community. There are those members who believe that the new non-classical logics are the most important ones for applications and that classical logic itself is now no longer the main workhorse of applied logic, and there are those who maintain that classical logic is the only logic worth considering and that within classical logic the Horn clause fragment is the most important one. The book presents a uniform Prolog-like formulation of the landscape of classical and non-classical logics, done in such away that the distinctions and movements from one logic to another seem simple and natural; and within it classical logic becomes just one among many. This should please the non-classical logic camp. It will also please the classical logic camp since the goal directed formulation makes it all look like an algorithmic extension of Logic Programming. The approach also seems to provide very good compuational complexity bounds across its landscape

Fuzzy Sets and Formal Logics

The paper discusses the relationship between fuzzy sets and formal logics as well as the influences fuzzy set theory had on the development of particular formal logics. Our focus is on the historical side of these developments. © 2015 Elsevier B.V. All rights reserved.partial support by the Spanish projects EdeTRI (TIN2012-39348- C02-01) and 2014 SGR 118.Peer reviewe

A Labelled Analytic Theorem Proving Environment for Categorial Grammar

We present a system for the investigation of computational properties of categorial grammar parsing based on a labelled analytic tableaux theorem prover. This proof method allows us to take a modular approach, in which the basic grammar can be kept constant, while a range of categorial calculi can be captured by assigning different properties to the labelling algebra. The theorem proving strategy is particularly well suited to the treatment of categorial grammar, because it allows us to distribute the computational cost between the algorithm which deals with the grammatical types and the algebraic checker which constrains the derivation.Comment: 11 pages, LaTeX2e, uses examples.sty and a4wide.st

S (for Syllogism) Revisited: "The Revolution Devours its Children"

In 1978, the authors began a paper, “S (for Syllogism),” henceforth [S4S], intended as a philosophical companion piece to the technical solution [SPW] of the Anderson-Belnap P–W problem. [S4S] has gone through a number of drafts, which have been circulated among close friends. Meanwhile other authors have failed to see the point of the semantics which we introduced in [SPW]. It will accordingly be our purpose here to revisit that semantics, while giving our present views on syllogistic matters past, present and future, especially as they relate to not begging the question via such dubious theses as A →’ A. We shall investigate in particular a paraconsistent attitude toward such theses

Relevant First-Order Logic LP#LP^\# and Curry's Paradox resolution

In 1942 Haskell B.Curry presented what is now called Curry paradox which can be found in a logic independently of its stand on negation.In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In this article the non-classical resolution of Curry's Paradox and Shaw-Kwei paradox without rejection any contraction postulate is proposed.Comment: 7page

A simplified lower bound for implicational logic

We present a streamlined and simplified exponential lower bound on the length of proofs in intuitionistic implicational logic, adapted to Gordeev and Haeusler's dag-like natural deduction.Comment: 31 page

Admissible rules and the Leibniz hierarchy

This paper provides a semantic analysis of admissible rules and associated completeness conditions for arbitrary deductive systems, using the framework of abstract algebraic logic. Algebraizability is not assumed, so the meaning and signi cance of the principal notions vary with the level of the Leibniz hierarchy at which they are presented. As a case study of the resulting theory, the non-algebraizable fragments of relevance logic are considered.This work is based on research supported in part by the National Research Foundation of South Africa (UID 85407).https://www.dukeupress.edu/notre-dame-journal-of-formal-logichb2016Mathematics and Applied Mathematic

Relevant Connexive Logic

In this paper, a connexive extension of the Relevance logic R→ was presented. It is defined by means of a natural deduction system, and a deductively equivalent axiomatic system is presented too. The goal of such an extension is to produce a logic with stronger connection between the antecedent and the consequent of an implication