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 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.     

Aristotle’s Non-Logical Works and the Square of Oppositions in Semiotics

This paper aims to highlight some peculiarities of the semiotic square, whose creation is due in particular to Greimas’ works. The starting point is the semiotic notion of complex term, which I regard as one of the main differences between Greimas’ square and Blanché’s hexagon. The remarks on the complex terms make room for a historical survey in Aristotle’s texts, where one can find the philosophical roots of the idea of middle term between two contraries and its relation to notions such as difference, position and motion. In the Stagirite’s non-logical works, the theory of the intermediate, or middle term, represents an important link between opposition issues and ethics: this becomes a privileged perspective from which to reconsider the semiotic use of the square, i.e., its inclusion in the semio-narrative structures articulating the sense of texts.      

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)     

Constants in Kripke Models for Intuitionistic Logic

We present a technique to extend a Kripke structure (for intuitionistic logic) into an elementary extension satisfying some property (cardinality, saturation, etc.) which can be “axiomatized” by a family of sets of sentences, where, most often, many constant symbols occur. To that end, we prove extended theorems of completeness and compactness. Also, a section of the paper is devoted to the back-and-forth construction of isomorphisms between Kripke structures.     

Singular Propositions,Negation and the Square of Opposition

This paper contains two traditions of diagrammatic studies namely one, the Euler–Venn–Peirce diagram and the other, following tradition of Aristotle, the square of oppositions. We put together both the traditions to study representations of singular propositions (through a diagram system Venn-i, involving constants), their negations and the inter relationship between the two. Along with classical negation we have incorporated negation of another kind viz. absence (taking a cue from the notion of ‘abhãva’ existing in ancient Indian knowledge system). We have also considered the changes that take place in the context of open universe.     

The Semantic Completeness of a Global Intuitionistic Logic

In this paper we will study a formal system of intuitionistic modal predicate logic. The main result is its semantic completeness theorem with respect to algebraic structures. At the end of the paper we will also present a brief consideration of its syntactic relationships with some similar systems.     

Describing a Basis in Semireduced Form for Inference Rules of Intuitionistic Logic

It is shown that a set of all rules in semireduced form whose premises satisfy a collection of specific conditions form a basis for all rules admissible in IPC. The conditions specified are quite natural, and many of them show up as properties of maximal theories in the canonical Kripke model for IPC. Besides, a similar basis is constructed for rules admissible in the superintuitionistic logic KC, a logic of the weak law of the excluded middle.     

Specialization of Loop Rules of a Sequent Calculus of Intuitionistic Temporal Logic with Time Gaps

The paper deals with the loop-rule problem in the first-order intuitionistic temporal logic sequent calculus LBJ. The calculus LBJT is intended for the specialization of the antecedent implication rule. The invertibility of some of the LBJT rules and the syntactic admissibility of the structural rules and the cut rule in LBJT, as well as the equivalence of LBJ and LBJT, are proved. The calculus LBJT2 is intended for the specialization of the antecedent universal quantifier and antecedent box rules. The decidability of LBJT2 is proved.     

基于L*-格值逻辑上的BCH-代数中的直觉不分明化理想

在L*-格值逻辑的语义框架下,以L*-格值上的Lukasiewicz蕴涵算子为工具定义了L*-格值逻辑上的直觉不分明化BCH-代数的概念,将用集论所刻画的BCH-代数与理想的概念在L*-格值谓词演算下给予了新的刻画,讨论了直觉不分明化BCH-代数中的理想、闭理想及q理想的有关性质.     

A Basis in Semi‐Reduced Form for the Admissible Rules of the Intuitionistic Logic IPC

We study the problem of finding a basis for all rules admissible in the intuitionistic propositional logic IPC. The main result is Theorem 3.1 which gives a basis consisting of all rules in semi‐reduced form satisfying certain specific additional requirements. Using developed technique we also find a basis for rules admissible in the logic of excluded middle law KC.     

直觉模糊命题逻辑的广义拟重言式及其分类

通过定义一个蕴涵算子,建立一个直觉模糊命题逻辑系统(I20, ,V,→T),讨论了系统I20上的广义拟重言式的分类,将王国俊教授的广义重言式理论从一维推广到二维的直觉模糊命题逻辑上.     

经典命题逻辑中的近似推理与强近似推理

基于命题逻辑公式之间相似度的概念,在经典命题逻辑系统中提出了两种近似推理模式,得到了它们的一些基本性质。讨论了这两种推理模式与经典推理模式之间的关系。此外,当理论Γ有限时,本文分别给出Γ在α程度上近似推出公式A和理论Σ的充要条件。最后,我们给出公式A与有限理论Γ的结论集D(Γ)之间距离的计算公式。     

强正则剩余格值逻辑系统（L）N及其完备性

正则剩余格是一类重要的模糊逻辑代数系统,而常见的模糊逻辑形式系统大多数带有非联接词,并且相应的Lindenbaum代数都是正则剩余格.本文以强正则剩余格为语义,建立了一个一般的命题演算形式系统LN,并且证明了这个系统的完备性.几种常见的带有非联接词的模糊逻辑形式系统都是系统LN的扩张.     

强正则剩余格值逻辑系统L~N及其完备性

正则剩余格是一类重要的模糊逻辑代数系统,而常见的模糊逻辑形式系统大多数带有非联接词,并且相应的Lindenbaum代数都是正则剩余格.本文以强正则剩余格为语义,建立了一个一般的命题演算形式系统LN,并且证明了这个系统的完备性.几种常见的带有非联接词的模糊逻辑形式系统都是系统LN的扩张.     

有限可补格上的格值逻辑的特征

本文给出了有限可补格上的格值逻辑的特征,即如果L是一个强于L_1的正则逻辑系统并且L有紧致性和LS性质,则L～L_1.