A Closer Look at Some Subintuitionistic Logics

@article{Celani2001ACL,
  title={A Closer Look at Some Subintuitionistic Logics},
  author={S. Celani and R. Jansana},
  journal={Notre Dame J. Formal Log.},
  year={2001},
  volume={42},
  pages={225-255}
}
In the present paper we study systematically several consequence relations on the usual language of propositional intuitionistic logic that can be defined semantically by using Kripke frames and the same defining truth conditions for the connectives as in intuitionistic logic but without imposing some of the conditions on the Kripke frames that are required in the intuitionistic case. The logics so obtained are called subintuitionistic logics in the literature. We depart from the perspective of… Expand
Weak subintuitionistic logics
TLDR
Completeness is proved for WF with respect to this neighbourhood semantics for non-normal modal logics, and similarly for some logics between WF and F which characterize nice frame classes. Expand
Predicate Logical Extensions of some Subintuitionistic Logics
TLDR
The paper presents predicate logical extensions of some subintuitionistic logics, which are modeled with a second accessibility relation, which is a partial order, for the interpretation of the universal quantifier. Expand
Classical and Empirical Negation in Subintuitionistic Logic
TLDR
This paper considers two negation expansions of subintuitionistic logic, one by classical negation and the other by what has been dubbed “empirical” negation, and provides an axiomatization of each expansion and shows them sound and strongly complete. Expand
Subintuitionistic logics and the implications they prove
Abstract 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 asExpand
Tree-Sequent Methods for Subintuitionistic Predicate Logics
TLDR
After proving the completeness with respect to some classes of Kripke models, this paper introduces Hilbert-style axiom systems and proves their completeness through a translation from the tree-sequent calculi to give a solution to the problem posed by Restall. Expand
Modal translation of substructural logics
TLDR
It is shown that every substructural (indeed, every non-distributive) logic is a fragment of a corresponding sorted, residuated (multi) modal logic. Expand
On weakening the Deduction Theorem and strengthening Modus Ponens
TLDR
This paper studies the effects of putting a bound on the cardinality of the set of side formulas in the Deduction Theorem and of adding additional assumptions inside the formulas present in Modus Ponens, viewed as a Gentzen-style rule, to isolate a denumerable collection of new Gentzen systems and two new sentential logics. Expand
Strict implication logics (e.g., intuitionistic propositional logic) correspond to removing symmetry from bisimilarity
The purpose of this contribution is to explain several results on the strict implication fragment (together with falsum, true, conjunction and disjunction) of the modal propositional language.Expand
The equational definability of truth predicates
  • J. Raftery
  • Mathematics, Computer Science
  • Reports Math. Log.
  • 2006
TLDR
The notion of an ‘algebraizable’ logic was made precise in the 1980s, mainly by Blok and Pigozzi, who provided intrinsic characterizations of the logics that are indeed algebraizable. Expand
Complexity of Strict Implication
  • F. Bou
  • Computer Science, Mathematics
  • Advances in Modal Logic
  • 2004
The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner’s Theorem remains valid when we restrict theExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 37 REFERENCES
Speaking about Transitive Frames in Propositional Languages
TLDR
A manageable model theory is developed for the induced consequence relation of the intuitionistic and classical modal languages interpreted in the standard way on transitive frames which reveals some unexpected phenomena. Expand
Constructive logic and the paradoxes
Heyting’s formalization of intuitionistic mathematics started many discussions about the meaning of the logical connectives in terms of proof and construction. We focus on the ideas and resultsExpand
Protoalgebraic logics
TLDR
A wide class of deductive systems of this kind called protoalgebraic logics are considered, which include almost all (non-pathological) systems of prepositional logic that have occurred in the literature. Expand
Subintuitionistic Logics
TLDR
This paper provides a characterization of eleven logics, using Kripke semantics, proof theory, and algebraic models, which unearths a family of logics below J. Expand
Displaying as Temporalizing
A particularly appealing feature of intuitionistic propositional logic, IPL, is that it may be regarded as the logic of cumulative research, see [12]. It is sound and complete with respect to theExpand
Basic Propositional Calculus I
TLDR
An axiomatization for Basic Propositional Calculus BPC is presented and a completeness theorem for the class of transitive Kripke structures is given and several refinements are presented, including a completion theorem for irreflexive trees. Expand
Modal Translations in K and D
TLDR
Heyting’s propositional Logic can be embedded in the modal propositional logic S4 by various modal translations, i.e. translations that prefix the necessity operator to certain subformulae of a nonmodal formula. Expand
What is Strict Implication?
  • I. Hacking
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1963
TLDR
In this presentation, ‘⊃’ stands for strict implication, and missing brackets for ‘¬’ are restored by association to the right, and a strict formula is one of the form A ⊃ B. Expand
A propositional logic with explicit fixed points
This paper studies a propositional logic which is obtained by interpreting implication as formal provability. It is also the logic of finite irreflexive Kripke Models.A Kripke Model completenessExpand
Basic Propositional Calculus II. Interpolation
Abstract. Let ℒ and ? be propositional languages over Basic Propositional Calculus, and ℳ = ℒ∩?. Weprove two different but interrelated interpolation theorems. First, suppose that Π is a sequentExpand
...
1
2
3
4
...