On the linear Lindenbaum algebra of Basic Propositional Logic

We study the linear Lindenbaum algebra of Basic Propositional Calculus, called linear basic algebra. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Exhibiting Wide Families of Maximal Intermediate Propositional Logics with the Disjunction Property

We provide results allowing to state, by the simple inspection of suitable classes of posets (propositional Kripke frames), that the corresponding intermediate propositional logics are maximal among the ones which satisfy the disjunction property. Starting from these results, we directly exhibit, without using the axiom of choice, the Kripke frames semantics of 2^No maximal intermediate propositional logics with the disjunction property. This improves previous evaluations, giving rise to the same conclusion but made with an essential use of the axiom of choice, of the cardinality of the set of the maximal intermediate propositional logics with the disjunction property. Mathematics Subject Classification: 03B55, 03C90.     

Basic Propositional Calculus II. Interpolation

Let ℒ and ? be propositional languages over Basic Propositional Calculus, and ℳ = ℒ∩?. Weprove two different but interrelated interpolation theorems. First, suppose that Π is a sequent theory over ℒ, and Σ∪ {C⇒C′} is a set of sequents over ?, such that Π,Σ⊢C⇒C′. Then there is a sequent theory Φ over ℳ such that Π⊢Φ and Φ, Σ⊢C⇒C′. Second, let A be a formula over ℒ, and C ₁, C ₂ be formulas over ?, such that A∧C ₁⊢C ₂. Then there exists a formula B over ℳ such that A⊢B and B∧C ₁⊢C ₂. Received: 7 January 1998 / Published online: 18 May 2001     

A Bounded Translation of Intuitionistic Propositional Logic into Basic Propositional Logic

In this paper we prove a bounded translation of intuitionistic propositional logic into basic propositional logic. Our new theorem, compared with the translation theorem in [1], has the advantage that it gives an effective bound on the translation, depending on the complexity of formulas.     

One Calculus of Nonderivable Formulas of Propositional Modal Logic

We obtain the upper bound for the number of applications of rules in the deduction tree of modal formulas in some variants of the S4 calculus. We use this estimate to construct the calculus where the only derivable formulas are those whose counterparts in S4 are unprovable.     

A Finite Hilbert-Style Axiomatization of the Implication-Less Fragment of the Intuitionistic Propositional Calculus

In this paper we obtain a finite Hilbert-style axiomatization of the implicationless fragment of the intuitionistic propositional calculus. As a consequence we obtain finite axiomatizations of all structural closure operators on the algebra of {–}-formulas containing this fragment. Mathematics Subject Classification: 03B20, 03B22, 06D15.     

A secondary semantics for Second Order Intuitionistic Propositional Logic

In this paper we propose a Kripke‐style semantics for second order intuitionistic propositional logic and we provide a semantical proof of the disjunction and the explicit definability property. Moreover, we provide a tableau calculus which is sound and complete with respect to such a semantics. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Interpreting Intuitionistic Propositional Logic in Terms of Intuitionistic Protothetics

An algebra of sentences of the quite intuitionistic protothetics, that is, an intuitionistic propositional logic with quantifiers augmented by the negation of the excluded middle, is a faithful model of intuitionistic propositional logic.     

A Sequent Calculus for Propositional Dynamic Logic for Agents

We consider propositional dynamic logic for agents. For this logic, we present a sequent calculus with a restricted cut rule and prove the soundness and completeness for the calculus.     

Subintuitionistic logics and the implications they prove

This is an investigation of the implications of IPC which remain provable when one weakens intuitionistic logic in various ways. The research is concerned with logics with Kripke models as introduced by G. Corsi in 1987, and others like G. Restall, Do?en, Visser. This leads to conservativity results for IPC with regard to classes of implications in some of these logics. Moreover, similar results are reached for some weaker subintuitionistic systems with neighborhood models introduced by the authors in 2016. In addition, the relationship between two types of neighborhood models introduced in that work is clarified. This clarification leads also to modal companions for weaker logics.     

A BRIEF SURVEY OF FRAMES FOR THE LAMBEK CALCULUS

Models for the Lambek calculus of syntactic categories surveyed here are based on frames that are in principle of the same type as Kripke frames for intuitionistic logic. These models are extracted from the literature on models for relevant logics, in particular the ternary relationed models introduced in the early seventies. The purpose of this brief survey is to locate some open completeness problems for variants of the Lambek calculus in the context of completeness results based on various types of ternary relational models.     

A Sequent Calculus for Propositional Dynamic Logic for Agents with Interactions

We consider a propositional dynamic logic for agents with interactions such as known commitment, no learning, and perfect recall. For this logic, we present a sequent calculus with a restricted cut rule and prove the soundness and completeness for the calculus.__________Published in Lietuvos Matematikos Rinkinys, Vol. 45, No. 2, pp. 261–269, April–June, 2005.     

Propositional union closed team logics

In this paper, we study several propositional team logics that are closed under unions, including propositional inclusion logic. We show that all these logics are expressively complete, and we introduce sound and complete systems of natural deduction for these logics. We also discuss the locality property and its connection with interpolation in these logics.     

在一种扩展多层感知器模型中实现命题知识的语义推演

§ 1.　Introduction　　Artificialintelligentisbasedonknowledgeexpression ,atthesametimeitisdependedonusingknowledge .Wecangetanalysisanddecisionandforecastbyusingknowledge .Inlogicsystem ,usingknowledgemeanslogicinferenceordeduction .Now ,manylogicsystemshavebeenproposedasformalmodelsforknowledgeexpressionandreasoning [1 ] ,[2 ] ,[6]— [9] .Althoughpropositionalcalculus(P(X) )isthesimplestlogicsystem ,itprovideswithuniversalmethodforotherlogicsystems.Asweknow ,reasoninginpropositionalcalculu…     

A spatial modal logic with a location interpretation

A spatial modal logic (SML) is introduced as an extension of the modal logic S4 with the addition of certain spatial operators. A sound and complete Kripke semantics with a natural space (or location) interpretation is obtained for SML. The finite model property with respect to the semantics for SML and the cut‐elimination theorem for a modified subsystem of SML are also presented. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The decision problem of provability logic with only one atom

The decision problem for provability logic remains PSPACE-complete even if the number of propositional atoms is restricted to one. This paper was supported by grant 401/01/0218 of the Grant Agency of the Czech Republic.     

扰动模糊命题逻辑的代数结构及其广义重言式性质

着眼于扰动模糊命题逻辑的代数结构,为研究二维扰动模糊命题逻辑最大子代数I2R及其广义重言式提供了一些代数理论基础,最后研究了子代数间广义重言式的关系.