模态逻辑典范框架的生成子框架

模态逻辑的典范性由“局部”典范性拼接而成。本文讨论了“局部”典范性问题,即一个模态逻辑的典范框架的什么样的生成子框架是该逻辑的框架。主要的结果是证明了一个逻辑的典范框架的有界宽的生成子框架都是该逻辑的框架,并且典范框架内嵌了所有该逻辑的有穷宽框架。     

K Altn的另一族正规扩张

Bellissima证明KAltn的正规扩张都是典范的,并且给出了一族连续统多的无有穷模型性的逻辑,本文构造出了KAltn的另一族连续统多的正规扩张,并且证明它们与Bellissima给出的颇为不同,它们要小得多,并且都具有有穷模型性。     

Definable Operators on Stable Set Lattices

Studia Logica - A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We...     

Relational semantics for full linear logic

Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic. In [4] it is shown that the theory of relational semantics is also available in the more general setting of substructural logic, at least in an algebraic guise. Building on these ideas, in [5] a type of frames is described which generalise Kripke frames and provide semantics for substructural logics in a purely relational form.In this paper we study full linear logic from an algebraic point of view. The main additional hurdle is the exponential. We analyse this operation algebraically and use canonical extensions to obtain relational semantics. Thus, we extend the work in [4], [5] and use their approach to obtain relational semantics for full linear logic. Hereby we illustrate the strength of using canonical extension to retrieve relational semantics: it allows a modular and uniform treatment of additional operations and axioms.Traditionally, so-called phase semantics are used as models for (provability in) linear logic [8]. These have the drawback that, contrary to our approach, they do not allow a modular treatment of additional axioms. However, the two approaches are related, as we will explain.     

Quantified extensions of canonical propositional intermediate logics

The quantified extension of a canonical prepositional intermediate logic is complete with respect to the generalization of Kripke semantics taking into consideration set-valued functors defined on a category.     

萨奎斯特逻辑的格

以萨奎斯特公式为额外公理添加到极小正规逻辑K上得到的逻辑都是完全的。这样得到的逻辑被称为萨奎斯特逻辑。所有的萨奎斯特逻辑组成了一个格。这个格中有可数无穷长的链以及可数无穷长的反链,格中的每个逻辑相对于格的不完全度是1。另外,萨奎斯特逻辑格的子格E具有规整的结构。     

Propositional relevance through letter-sharing

The concept of relevance between classical propositional formulae, defined in terms of letter-sharing, has been around for a long time. But it began to take on a fresh life in the late 1990s when it was reconsidered in the context of the logic of belief change. Two new ideas appeared in independent work of Odinaldo Rodrigues and Rohit Parikh: the relation of relevance was considered modulo the choice of a background belief set, and the belief set was put into a canonical form, called its finest splitting. In the first part of this paper, we recall the ideas of Rodrigues and Parikh, and show that they yield equivalent definitions of what may be called canonical cell/path relevance. The second part presents the main new result of the paper: while the relation of canonical relevance is syntax-independent in the usual sense of the term, it nevertheless remains language-dependent in a deeper sense, as is shown with an example. The final part of the paper turns to questions of application, where we present a new concept of parameter-sensitive relevance that relaxes the Rodrigues/Parikh definition, allowing it to take into account extra-logical sources as well as purely logical ones.     

La méthode d’intervention en psychodynamique du travail face au « tournant gestionnaire » : l’exemple d’une intervention dans une unité mixte de recherche

This text aims to show the continuing interest in using the “canonical” method of investigation in work psychodynamics in the context of what is commonly called the managerial turning point. In order to demonstrate this methodology, the authors will rely on a survey conducted in a U.M.R of science called “hard science” following a recommendation of the Agency for evaluation of research and higher education. We will raise the impact of this intervention, allowing participants to think about their work relationship and the necessary modalities in order to do it continuously well, within the managerial logic context.     

A Canonical Model for Constant Domain Basic First-Order Logic

Studia Logica - I build a canonical model for constant domain basic first-order logic ( $$\textsf {BQL}_{\textsf {CD}}$$ ), the constant domain first-order extension of Visser’s basic...     

The Basic Algebra of Game Equivalences

We give a complete axiomatization of the identities of the basic game algebra valid with respect to the abstract game board semantics. We also show that the additional conditions of termination and determinacy of game boards do not introduce new valid identities.En route we introduce a simple translation of game terms into plain modal logic and thus translate, while preserving validity both ways, game identities into modal formulae.The completeness proof is based on reduction of game terms to a certain minimal canonical form, by using only the axiomatic identities, and on showing that the equivalence of two minimal canonical terms can be established from these identities.     

The Logic of Causal Explanation An Axiomatization

Three-valued (strong-Kleene) modal logic provides the foundation for a new approach to formalizing causal explanation as a relation between partial situations. The approach makes fine-grained distinctions between aspects of events, even between aspects that are equivalent in classical logic. The framework can accommodate a variety of ontologies concerning the relata of causal explanation. I argue, however, for a tripartite ontology of objects corresponding to sentential nominals: facts, tropes (or facta or states of affairs), and situations (or events). I axiomatize the relations and use canonical models to demonstrate completeness.     

An Axiomatic System and a Tableau Calculus for STIT Imagination Logic

We formulate a Hilbert-style axiomatic system and a tableau calculus for the STIT-based logic of imagination recently proposed in Wansing (2015). Completeness of the axiom system is shown by the method of canonical models; completeness of the tableau system is also shown by using standard methods.     

Error analysis of digital filters using HOL theorem proving

When a digital filter is realized with floating-point or fixed-point arithmetics, errors and constraints due to finite word length are unavoidable. In this paper, we show how these errors can be mechanically analysed using the HOL theorem prover. We first model the ideal real filter specification and the corresponding floating-point and fixed-point implementations as predicates in higher-order logic. We use valuation functions to find the real values of the floating-point and fixed-point filter outputs and define the error as the difference between these values and the corresponding output of the ideal real specification. Fundamental analysis lemmas have been established to derive expressions for the accumulation of roundoff error in parametric Lth-order digital filters, for each of the three canonical forms of realization: direct, parallel, and cascade. The HOL formalization and proofs are found to be in a good agreement with existing theoretical paper-and-pencil counterparts.     

Axiomatic Extensions of IMT3 Logic

In this paper we characterize, classify and axiomatize all axiomatic extensions of the IMT3 logic. This logic is the axiomatic extension of the involutive monoidal t-norm logic given by ¬φ³ ∨ φ. For our purpose we study the lattice of all subvarieties of the class IMT3, which is the variety of IMTL-algebras given by the equation ¬(x³) ∨ x ≈ ?, and it is the algebraic counterpart of IMT3 logic. Since every subvariety of IMT3 is generated by their totally ordered members, we study the structure of all IMT3-chains in order to determine the lattice of all subvarieties of IMT3. Given a family of IMT3-chains the number of elements of the largest odd finite subalgebra in the family and the number of elements of the largest even finite subalgebra in the family turns out to be a complete classifier of the variety generated. We obtain a canonical set of generators and a finite equational axiomatization for each subvariety and, for each corresponding logic, a finite set of characteristic matrices and a finite set of axioms.     

Hybrid logic with the difference modality for generalisations of graphs

We discuss recent work generalising the basic hybrid logic with the difference modality to any reasonable notion of transition. This applies equally to both subrelational transitions such as monotone neighbourhood frames or selection function models as well as those with more structure such as Markov chains and alternating temporal frames. We provide a generic canonical cut-free sequent system and a terminating proof-search strategy for the fragment without the difference modality but including the global modality.     

The Harmony of Identity

The standard natural deduction rules for the identity predicate have seemed to some not to be harmonious. Stephen Read has suggested an alternative introduction rule that restores harmony but presupposes second-order logic. Here it will be shown that the standard rules are in fact harmonious. To this end, natural deduction will be enriched with a theory of definitional identity. This leads to a novel conception of canonical derivation, on the basis of which the identity elimination rule can be justified in a proof-theoretical manner.

     

Modal Logic,Truth, and the Master Modality

In the paper (Braüner, 2001) we gave a minimal condition for the existence of a homophonic theory of truth for a modal or tense logic. In the present paper we generalise this result to arbitrary modal logics and we also show that a modal logic permits the existence of a homophonic theory of truth if and only if it permits the definition of a so-called master modality. Moreover, we explore a connection between the master modality and hybrid logic: We show that if attention is restricted to bidirectional frames, then the expressive power of the master modality is exactly what is needed to translate the bounded fragment of first-order logic into hybrid logic in a truth preserving way. We believe that this throws new light on Arthur Prior's fourth grade tense logic.     

On Fork Arrow Logic and its Expressive Power

We compare fork arrow logic, an extension of arrow logic, and its natural first-order counterpart (the correspondence language) and show that both have the same expressive power. Arrow logic is a modal logic for reasoning about arrow structures, its expressive power is limited to a bounded fragment of first-order logic. Fork arrow logic is obtained by adding to arrow logic the fork modality (related to parallelism and synchronization). As a result, fork arrow logic attains the expressive power of its first-order correspondence language, so both can express the same input–output behavior of processes.     

Leibniz and the Square: A Deontic Logic for the Vir Bonus

Seventeenth century philosopher Gottfried Leibniz's contributions to metaphysics, mathematics, and logic are well known. Lesser known is his ‘invention’ of deontic logic, and that his invention derives from the alethic logic of the Aristotelian square of opposition. In this paper, I show how Leibniz developed this ‘logic of duties’, which designates actions as ‘possible, necessary, impossible, and omissible’ for a ‘vir bonus’ (good person). I show that for Leibniz, deontic logic can determine whether a given action, e.g. as permitted, is therefore obligatory or prohibited (impossible). Secondly, since the deontic modes are derived from what is possible, necessary, etc., for a good person to do, and that ‘right and obligation’ are the ‘moral qualities’ of a good person, we can see how Leibniz derives deontic logic from these moral qualities. Finally, I show how Leibniz grounds a central deontic concept, namely obligation, in the human capacity for freedom.