Heinrich Wansing

The relationships between various modal logics based on Belnap and Dunn’s paraconsistent four-valued logic FDE are investigated. It is shown that the paraconsistent modal logic \, which lacks a primitive possibility operator \, is definitionally equivalent with the logic \, which has both \ and \ as primitive modalities. Next, a tableau calculus for the paraconsistent modal logic KN4 introduced by L. Goble is defined and used to show that KN4 is definitionally equivalent with \ without the absurdity constant. Moreover, a tableau calculus is defined for the modal bilattice logic MBL introduced and investigated by A. Jung, U. Rivieccio, and R. Jansana. MBL is a generalization of BK that in its Kripke semantics makes use of a four-valued accessibility relation. It is shown that MBL can be faithfully embedded into the bimodal logic \ over the non-modal vocabulary of MBL. On the way from \ to MBL, the Fischer Servi-style modal logic \ is defined as the set of all modal formulas valid under a modified standard translation into first-order FDE, and \ is shown to be characterized by the class of all models for \. Moreover, \ is axiomatized and this axiom system is proved to be strongly sound and complete with respect to the class of models for \. Moreover, the notion of definitional equivalence is suitably weakened, so as to show that \ and \ are weakly definitionally equivalent.

"This volume comprises the proceedings of the First All-Berlin Workshop on Nonclassical Logics and Information Processing, held at the Free University of Berlin, November 9-10, 1990. The scope of the ten papers in the volume is broad, covering various different subfields of logic - particularly nonclassical logic - and its applications in artificial intelligence. The papers are grouped according to the four major topics that emerged at the meeting: modal systems, logic programming, nonmonotonic logics, and proof theory. The classification is only a rough guide since the four areas overlap considerably."--PUBLISHER'S WEBSITE.

In this paper it is suggested to generalize our understanding of general (structural) proof theory and to consider it as a general theory of two kinds of derivations, namely proofs and dual proofs. The proposal is substantiated by (i) considerations on assertion, denial, and bi-lateralism, (ii) remarks on compositionality in proof-theoretic semantics, and (iii) comments on falsification and co-implication. The main formal result of the paper is a normal form theorem for the natural deduction proof system N2Int of the bi-intuitionistic logic 2Int. The proof makes use of the faithful embedding of 2Int into intuitionistic logic with respect to validity and shows that conversions of dual proofs can be sidestepped.

Many logical systems are such that the addition of Prior's binary connective tonk to them leads to triviality, see [1, 8]. Since tonk is given by some introduction and elimination rules in natural deduction or sequent rules in Gentzen's sequent calculus, the unwanted effects of adding tonk show that some kind of restriction has to be imposed on the acceptable operational inferences rules, in particular if these rules are regarded as definitions of the operations concerned. In this paper, a number of simple observations is made showing that the unwanted phenomenon exemplified by tonk in some logics also occurs in contexts in which tonk is acceptable. In fact, in any non-trivial context, the acceptance of arbitrary introduction rules for logical operations permits operations leading to triviality. Connectives that in all non-trivial contexts lead to triviality will be called non-trivially trivializing connectives

Two new first-order paraconsistent logics with De Morgan-type negations and co-implication, called symmetric paraconsistent logic (SPL) and dual paraconsistent logic (DPL), are introduced as Gentzen-type sequent calculi. The logic SPL is symmetric in the sense that the rule of contraposition is admissible in cut-free SPL. By using this symmetry property, a simpler cut-free sequent calculus for SPL is obtained. The logic DPL is not symmetric, but it has the duality principle. Simple semantics for SPL and DPL are introduced, and the completeness theorems with respect to these semantics are proved. The cut-elimination theorems for SPL and DPL are proved in two ways: One is a syntactical way which is based on the embedding theorems of SPL and DPL into Gentzen’s LK, and the other is a semantical way which is based on the completeness theorems.

Imagination has recently attracted considerable attention from epistemologists and is recognized as a source of belief and even knowledge. One remarkable feature of imagination is that it is often and typically agentive: agents decide to imagine. In cases in which imagination results in a belief, the agentiveness of imagination may be taken to give rise to indirect doxastic control and epistemic responsibility. This observation calls for a proper understanding of agentive imagination. In particular, it calls for the development of a semantics of imagination ascriptions. In the present paper an earlier suggestion by Ilkka Niiniluoto for a logic of imagination is considered. This proposal does not capture the agentive nature of imagination, and an alternative semantics is suggested. The new semantics combines the modal logic of agency with the neighbourhood semantics from alethic modal logic

In this paper non-normal worlds semantics is presented as a basic, general, and unifying approach to epistemic logic. The semantical framework of non-normal worlds is compared to the model theories of several logics for knowledge and belief that were recently developed in Artificial Intelligence (AI). It is shown that every model for implicit and explicit belief (Levesque), for awareness, general awareness, and local reasoning (Fagin and Halpern), and for awareness and principles (van der Hoek and Meyer) induces a non-normal worlds model validating precisely the same formulas (of the language in question).

Since it is desirable to be able to talk about rational agents forming attitudes toward their concrete agency, we suggest an introduction of doxastic, volitional, and intentional modalities into the multi-agent logic of deliberatively seeing to it that, dstit logic. These modalities are borrowed from the well-known BDI (belief-desire-intention) logic. We change the semantics of the belief and desire operators from a relational one to a monotonic neighbourhood semantic in order to handle ascriptions of conflicting but not inconsistent beliefs and desires as being satisfiable. The proposed bdi-stit logic is defined with respect to branching time frames, and it is shown that this logic is a generalization of a bdi logic based on branching time possible worlds frames (but without temporal operators) and dstit logic. The new bdi-stit logic generalizes bdi and dstit logic in the sense that for any model of bdi or dstit logic, there is an equivalent bdi-stit model

Curry’s paradox is well known. The original version employed a conditional connective, and is not forthcoming if the conditional does not satisfy contraction. A newer version uses a validity predicate, instead of a conditional, and is not forthcoming if validity does not satisfy structural contraction. But there is a variation of the paradox which uses “external validity”. And since external validity contracts, one might expect the appropriate version of the Curry paradox to be inescapable. In this paper we show that this is not the case. We consider two ways of formalising the notion of external validity, and show that in both of these the paradox is not forthcoming without the appropriate forms of contraction

The paper provides a uniform Gentzen-style proof-theoretic framework for various subsystems of classical predicate logic. In particular, predicate logics obtained by adopting van Behthem''s modal perspective on first-order logic are considered. The Gentzen systems for these logics augment Belnap''s display logic by introduction rules for the existential and the universal quantifier. These rules for x and x are analogous to the display introduction rules for the modal operators and and do not themselves allow the Barcan formula or its converse to be derived. En route from the minimal modal predicate logic to full first-order logic, axiomatic extensions are captured by purely structural sequent rules.

This paper sheds light on the relationship between the logic of generalized truth values and the logic of bilattices. It suggests a definite solution to the problem of axiomatizing the truth and falsity consequence relations, \ and \ , considered in a language without implication and determined via the truth and falsity orderings on the trilattice SIXTEEN 3 . The solution is based on the fact that a certain algebra isomorphic to SIXTEEN 3 generates the variety of commutative and distributive bilattices with conflation