SUBSTRUCTURAL INQUISITIVE LOGICS

2019 ◽  
Vol 12 (2) ◽  
pp. 296-330 ◽  
Author(s):  
VÍT PUNČOCHÁŘ
Keyword(s):  
Fuzzy Logic ◽  
General Theory ◽  
Propositional Logic ◽  
Substructural Logics ◽  
Substructural Logic ◽  
Fuzzy Logics ◽  
Inquisitive Semantics ◽  
Semantic Framework ◽  
Noncommutative Version ◽  
Image Position

AbstractThis paper shows that any propositional logic that extends a basic substructural logic BSL (a weak, nondistributive, nonassociative, and noncommutative version of Full Lambek logic with a paraconsistent negation) can be enriched with questions in the style of inquisitive semantics and logic. We introduce a relational semantic framework for substructural logics that enables us to define the notion of an inquisitive extension of λ, denoted as ${\lambda ^?}$, for any logic λ that is at least as strong as BSL. A general theory of these “inquisitive extensions” is worked out. In particular, it is shown how to axiomatize ${\lambda ^?}$, given the axiomatization of λ. Furthermore, the general theory is applied to some prominent logical systems in the class: classical logic Cl, intuitionistic logic Int, and t-norm based fuzzy logics, including for example Łukasiewicz fuzzy logic Ł. For the inquisitive extensions of these logics, axiomatization is provided and a suitable semantics found.

UNIFORM INTERPOLATION IN SUBSTRUCTURAL LOGICS

2014 ◽  
Vol 7 (3) ◽  
pp. 455-483 ◽  
Author(s):  
MAJID ALIZADEH ◽  
FARZANEH DERAKHSHAN ◽  
HIROAKIRA ONO
Keyword(s):  
Propositional Logic ◽  
Predicate Logic ◽  
Interpolation Property ◽  
Substructural Logics ◽  
Substructural Logic ◽  
Sequent Calculi ◽  
Structural Rule ◽  
Modal Propositional Logic ◽  
Uniform Interpolation ◽  
Classical Predicate

AbstractUniform interpolation property of a given logic is a stronger form of Craig’s interpolation property where both pre-interpolant and post-interpolant always exist uniformly for any provable implication in the logic. It is known that there exist logics, e.g., modal propositional logic S4, which have Craig’s interpolation property but do not have uniform interpolation property. The situation is even worse for predicate logics, as classical predicate logic does not have uniform interpolation property as pointed out by L. Henkin.In this paper, uniform interpolation property of basic substructural logics is studied by applying the proof-theoretic method introduced by A. Pitts (Pitts, 1992). It is shown that uniform interpolation property holds even for their predicate extensions, as long as they can be formalized by sequent calculi without contraction rules. For instance, uniform interpolation property of full Lambek predicate calculus, i.e., the substructural logic without any structural rule, and of both linear and affine predicate logics without exponentials are proved.

A Mathematical Setting for Fuzzy Logics

1997 ◽  
Vol 05 (03) ◽  
pp. 223-238 ◽  
Author(s):  
Mai Gehrke ◽  
Carol Walker ◽  
Elbert Walker
Keyword(s):  
Fuzzy Logic ◽  
Propositional Logic ◽  
Normal Forms ◽  
Unit Interval ◽  
Fuzzy Logics ◽  
Real Numbers ◽  
Truth Values ◽  
Finite Algebras ◽  
Finite Algorithms ◽  
Interval Valued

The setup of a mathematical propositional logic is given in algebraic terms, describing exactly when two choices of truth value algebras give the same logic. The propositional logic obtained when the algebra of truth values is the real numbers in the unit interval equipped with minimum, maximum and -x=1-x for conjunction, disjunction and negation, respectively, is the standard propositional fuzzy logic. This is shown to be the same as three-valued logic. The propositional logic obtained when the algebra of truth values is the set {(a, b)|a≤ b and a,b∈[0,1]} of subintervals of the unit interval with component-wise operations, is propositional interval-valued fuzzy logic. This is shown to be the same as the logic given by a certain four element lattice of truth values. Since both of these logics are equivalent to ones given by finite algebras, it follows that there are finite algorithms for determining when two statements are logically equivalent within either of these logics. On this topic, normal forms are discussed for both of these logics.

scholarly journals Basic Core Fuzzy Logics and Algebraic Routley–Meyer-Style Semantics

Axioms ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 273
Author(s):  
Eunsuk Yang
Keyword(s):  
Fuzzy Logic ◽  
Substructural Logics ◽  
Algebraic Semantics ◽  
Relational Semantics ◽  
Fuzzy Logics

Recently, algebraic Routley–Meyer-style semantics was introduced for basic substructural logics. This paper extends it to fuzzy logics. First, we recall the basic substructural core fuzzy logic MIAL (Mianorm logic) and its axiomatic extensions, together with their algebraic semantics. Next, we introduce two kinds of ternary relational semantics, called here linear Urquhart-style and Fine-style Routley–Meyer semantics, for them as algebraic Routley–Meyer-style semantics.

scholarly journals Glivenko theorems for substructural logics over FL

2006 ◽  
Vol 71 (4) ◽  
pp. 1353-1384 ◽  
Author(s):  
Nikolaos Galatos ◽  
Hiroakira Ono
Keyword(s):  
Propositional Logic ◽  
Substructural Logics ◽  
Residuated Lattices ◽  
Substructural Logic ◽  
Classical Propositional Logic ◽  
Double Negation ◽  
Glivenko’S Theorem

AbstractIt is well known that classical propositional logic can be interpreted in intuitionistic prepositional logic. In particular Glivenko's theorem states that a formula is provable in the former iff its double negation is provable in the latter. We extend Glivenko's theorem and show that for every involutive substructural logic there exists a minimum substructural logic that contains the first via a double negation interpretation. Our presentation is algebraic and is formulated in the context of residuated lattices. In the last part of the paper, we also discuss some extended forms of the Koltnogorov translation and we compare it to the Glivenko translation.

Very true on CBA fuzzy logic

2010 ◽  
Vol 60 (4) ◽  
Author(s):  
Michal Botur ◽  
Filip Švrček
Keyword(s):  
Fuzzy Logic ◽  
Propositional Logic ◽  
Fuzzy Logics ◽  
Algebraic Semantic

AbstractCBA logic was introduced as a non-associative generalization of the Łukasiewicz many-valued propositional logic. Its algebraic semantic is just the variety of commutative basic algebras. Petr Hájek introduced vt-operators as models for the “very true” connective on fuzzy logics. The aim of the paper is to show possibilities of using vt-operators on commutative basic algebras, especially we show that CBA logic endowed with very true connective is still fuzzy.

scholarly journals HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM?

2020 ◽  
pp. 1-18
Author(s):  
GUILLERMO BADIA ◽  
PETR CINTULA ◽  
PETR HÁJEK ◽  
ANDREW TEDDER
Keyword(s):  
Fuzzy Logic ◽  
Intuitionistic Logic ◽  
Propositional Logic ◽  
Substructural Logic ◽  
Arithmetic Operations ◽  
Arithmetic Theory ◽  
Undecidability Result

Abstract In this paper we explore the following question: how weak can a logic be for Rosser’s essential undecidability result to be provable for a weak arithmetical theory? It is well known that Robinson’s Q is essentially undecidable in intuitionistic logic, and P. Hájek proved it in the fuzzy logic BL for Grzegorczyk’s variant of Q which interprets the arithmetic operations as nontotal nonfunctional relations. We present a proof of essential undecidability in a much weaker substructural logic and for a much weaker arithmetic theory, a version of Robinson’s R (with arithmetic operations also interpreted as mere relations). Our result is based on a structural version of the undecidability argument introduced by Kleene and we show that it goes well beyond the scope of the Boolean, intuitionistic, or fuzzy logic.

On the centres of hereditary JBW-subalgebras of a JBW-algebra

1979 ◽  
Vol 85 (2) ◽  
pp. 317-324 ◽  
Author(s):  
C. M. Edwards
Keyword(s):  
Banach Space ◽  
General Theory ◽  
Jordan Algebra ◽  
Identity Element ◽  
Image Position

A JB-algebra A is a real Jordan algebra, which is also a Banach space, the norm in which satisfies the conditions thatandfor all elements a and b in A. It follows from (1.1) and (l.2) thatfor all elements a and b in A. When the JB-algebra A possesses an identity element then A is said to be a unital JB-algebra and (1.2) is equivalent to the condition thatfor all elements a and b in A. For the general theory of JB-algebras the reader is referred to (2), (3), (7) and (10).

scholarly journals A Modern Syllogistic Method in Intuitionistic Fuzzy Logic with Realistic Tautology

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Ali Muhammad Rushdi ◽  
Mohamed Zarouan ◽  
Taleb Mansour Alshehri ◽  
Muhammad Ali Rushdi
Keyword(s):  
Fuzzy Logic ◽  
Propositional Logic ◽  
Compact Form ◽  
Logical Function ◽  
Intuitionistic Fuzzy ◽  
Complete Product ◽  
Single Function ◽  
Intuitionistic Fuzzy Logic

The Modern Syllogistic Method (MSM) of propositional logic ferrets out from a set of premisesallthat can be concluded from it in the most compact form. The MSM combines the premises into a single function equated to 1 and then produces the complete product of this function. Two fuzzy versions of MSM are developed in Ordinary Fuzzy Logic (OFL) and in Intuitionistic Fuzzy Logic (IFL) with these logics augmented by the concept of Realistic Fuzzy Tautology (RFT) which is a variable whose truth exceeds 0.5. The paper formally proves each of the steps needed in the conversion of the ordinary MSM into a fuzzy one. The proofs rely mainly on the successful replacement of logic 1 (or ordinary tautology) by an RFT. An improved version of Blake-Tison algorithm for generating the complete product of a logical function is also presented and shown to be applicable to both crisp and fuzzy versions of the MSM. The fuzzy MSM methodology is illustrated by three specific examples, which delineate differences with the crisp MSM, address the question of validity values of consequences, tackle the problem of inconsistency when it arises, and demonstrate the utility of the concept of Realistic Fuzzy Tautology.

The decidability of the Kreisel-Putnam system

1970 ◽  
Vol 35 (3) ◽  
pp. 431-437 ◽  
Author(s):  
Dov M. Gabbay
Keyword(s):  
Intuitionistic Logic ◽  
Propositional Logic ◽  
Finite Model ◽  
Model Property ◽  
Intuitionistic Propositional Logic ◽  
Disjunction Property ◽  
Finite Model Property ◽  
Image Position

The intuitionistic propositional logic I has the following disjunction property This property does not characterize intuitionistic logic. For example Kreisel and Putnam [5] showed that the extension of I with the axiomhas the disjunction property. Another known system with this propery is due to Scott [5], and is obtained by adding to I the following axiom:In the present paper we shall prove, using methods originally introduced by Segerberg [10], that the Kreisel-Putnam logic is decidable. In fact we shall show that it has the finite model property, and since it is finitely axiomatizable, it is decidable by [4]. The decidability of Scott's system was proved by J. G. Anderson in his thesis in 1966.

Sign in / Sign up

Export Citation Format

Share Document