Predicate Logics on Display

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.     

Advanced Brief Strategic Therapy: An overview of interventions with eating disorders to exemplify how theory and practice work

This paper aims at introducing some of the central aspects of the evolution that brief strategic therapy has undergone at the Centro di Terapia Strategica of Arezzo, Italy, towards advanced therapeutic strategies which differ from the original Palo Alto model. (Fisch, Weakland, &; Segal, 1982; Watzlawick, 1978 Watzlawick, P. 1978. The language of change: Elements of therapeutic communication, New York: Basic Books.  [Google Scholar]; Watzlawick, Beavin, &; Jackson, 1967; Watzlawick, Weakland, &; Fisch, 1974). We will focus on how the concept of self-deception is central to the formation and the persistence of psychological disorders; and how the usage of non-ordinary logics and the understanding of the individual's perceptive-reactive system are of key importance in unravelling such disorders, allowing the therapist to guide the patient towards an efficacious and efficient solution. Rather than attempting to describe and enlist the theoretical corpus that underlies brief strategic therapy, we have chosen to exemplify some focal concepts that connect theory to practice, and vice versa, by presenting the outline of some therapeutic protocols devised for solving eating disorders which can be specifically tailored for each individual patient.     

Transfers between Logics and their Applications

In this paper, logics are conceived as two-sorted first-order structures, and we argue that this broad definition encompasses a wide class of logics with theoretical interest as well as interest from the point of view of applications. The language, concepts and methods of model theory can thus be used to describe the relationship between logics through morphisms of structures called transfers. This leads to a formal framework for studying several properties of abstract logics and their attributes such as consequence operator, syntactical structure, and internal transformations. In particular, we treat Belief Revision Systems (BRS) as our main example, defining the Wide Belief Revision Systems (WBRS's). This generalization allows us to define BRS's in an abstract setting for classical and non-standard logics. We also show how the concept of translation between logics can be obtained as a particular case of transfers.     

Subjective Situations and Logical Omniscience

The beliefs of the agents in a multi-agent system have been formally modelled in the last decades using doxastic logics. The possible worlds model and its associated Kripke semantics provide an intuitive semantics for these logics, but they commit us to model agents that are logically omniscient. We propose a way of avoiding this problem, using a new kind of entities called subjective situations. We define a new doxastic logic based on these entities and we show how the belief operators have some desirable properties, while avoiding logical omniscience. A comparison with two well-known proposals (Levesque's logic of explicit and implicit beliefs and Thijsse's hybrid sieve systems) is also provided.     

Closure Operators and Complete Embeddings of Residuated Lattices

In this paper, a theorem on the existence of complete embedding of partially ordered monoids into complete residuated lattices is shown. From this, many interesting results on residuated lattices and substructural logics follow, including various types of completeness theorems of substructural logics.     

The Undecidability of Grisin's Set Theory

We investigate a contractionless naive set theory, due to Grisin [11]. We prove that the theory is undecidable.     

Algorithmic Proof Methods and Cut Elimination for Implicational Logics Part I: Modal Implication

In this work we develop goal-directed deduction methods for the implicational fragment of several modal logics. We give sound and complete procedures for strict implication of K, T, K4, S4, K5, K45, KB, KTB, S5, G and for some intuitionistic variants. In order to achieve a uniform and concise presentation, we first develop our methods in the framework of Labelled Deductive Systems [Gabbay 96]. The proof systems we present are strongly analytical and satisfy a basic property of cut admissibility. We then show that for most of the systems under consideration the labelling mechanism can be avoided by choosing an appropriate way of structuring theories. One peculiar feature of our proof systems is the use of restart rules which allow to re-ask the original goal of a deduction. In case of K, K4, S4 and G, we can eliminate such a rule, without loosing completeness. In all the other cases, by dropping such a rule, we get an intuitionistic variant of each system. The present results are part of a larger project of a goal directed proof theory for non-classical logics; the purpose of this project is to show that most implicational logics stem from slight variations of a unique deduction method, and from different ways of structuring theories. Moreover, the proof systems we present follow the logic programming style of deduction and seem promising for proof search [Gabbay and Reyle 84, Miller et al. 91].     

Many-Valued Logics and Suszko's Thesis Revisited

Suszko's Thesis maintains that many-valued logics do not exist at all. In order to support it, R. Suszko offered a method for providing any structural abstract logic with a complete set of bivaluations. G. Malinowski challenged Suszko's Thesis by constructing a new class of logics (called q-logics by him) for which Suszko's method fails. He argued that the key for logical two-valuedness was the "bivalent" partition of the Lindenbaum bundle associated with all structural abstract logics, while his q-logics were generated by "trivalent" matrices. This paper will show that contrary to these intuitions, logical two-valuedness has more to do with the geometrical properties of the deduction relation of a logical structure than with the algebraic properties embedded on it.     

The Concept of Intermediate Existence in the Early Buddhist Theory of rebirth

This article investigates the concept of intermediate existence in the early Buddhist theory of rebirth. The main sources investigated for this article are the Pāli canonical and commentarial literature. My main thesis is that early Buddhist discourses contain instances that suggest a spatial-temporal gap between death and rebirth known as ‘intermediate existence’ (antarābhava), in contrast to the idea of Theravāda Buddhist theory that rebirth takes place immediately without a spatial-temporal gap. In order to prove this, I argue that the ‘one who liberates in interval’ (anarāparinibbāyī) attains Nibbāna in the intermediate existence and the concept of gandhabbā in early Buddhist discourses refers to a being in intermediate existence, not to a dying consciousness (cuti-viññāna), and there are indirect inferences to an spatiotemporal gap between death and rebirth in the early Buddhist discourses.