Maximality of bi-intuitionistic propositional logic

@article{Olkhovikov2021MaximalityOB,
  title={Maximality of bi-intuitionistic propositional logic},
  author={Grigory K. Olkhovikov and Guillermo Badia},
  journal={J. Log. Comput.},
  year={2021},
  volume={32},
  pages={1-31}
}
In the style of Lindström’s theorem for classical first-order logic, this article characterizes propositional bi-intuitionistic logic as the maximal (with respect to expressive power) abstract logic satisfying a certain form of compactness, the Tarski union property and preservation under bi-asimulations. Since bi-intuitionistic logic introduces new complexities in the intuitionistic setting by adding the analogue of a backwards looking modality, the present paper constitutes a non-trivial… 
View PDF on arXiv
2 Citations
Background Citations
2
Methods Citations
1

2 Citations

Craig Interpolation Theorem fails in Bi-intuitionistic Predicate Logic

. In this article we show that bi-intuitionistic predicate logic lacks the Craig Interpolation Property. We proceed by adapting the counterexample given by Mints, Olkhovikov and Urquhart for…

Nature of Knowledge in Philosophy

This article is devoted to the philosophical study of the conditions under which knowledge can become a component or tool of education. The presentation of the contribution of epistemology to human…

References

SHOWING 1-10 OF 34 REFERENCES

Bi-Simulating in Bi-Intuitionistic Logic

This note characterize the expressive power of this logic by showing that the first order formulas equivalent to translations of bi-intuitionistic propositional formulas are exactly those preserved under bi-intoitionistic directed bisimulations.

Hennessy-Milner Properties for (Modal) Bi-intuitionistic Logic

The main result is a Hennessy-Milner property for bi-intuitionistic logic interpreted over certain classes of Kripke models, and the use of behavioural equivalence.

Natural deduction for bi-intuitionistic logic

MODEL-THEORETIC CHARACTERIZATION OF INTUITIONISTIC PROPOSITIONAL FORMULAS

It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula over the class of intuitionistic Kripke models iff it is invariant with respect to asimulations between intuitionistic models.

ANALYTIC CUT AND INTERPOLATION FOR BI-INTUITIONISTIC LOGIC

Applying a version of Maehara technique modified in several ways, it is proved that bi-intuitionistic logic enjoys the classical Craig interpolation property and Maximova variable separation property; its Halldén completeness follows.

A Lindström theorem for modal logic

A modal analogue of Lindstrr om's characterization of rst-order logic is proved. Basic modal logics are characterized as the only modal logics that have a notion of nite rank, or, equivalently, as…

Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic

This work presents a new cut-free sequent calculus for bi-intuitionistic logic, and proves it sound and complete with respect to its Kripke semantics.

Extending Intuitionistic Logic with Subtraction

This paper is an exercise in formal and philosophical logic. I will show how intuitionistic propositional logic can be extended with a new two-place connective, not expressible in the traditional…

A General Lindström Theorem for Some Normal Modal Logics

  • S. Enqvist
  • Philosophy, Mathematics
    Logica Universalis
  • 2013
A generic Lindström theorem is proved that covers any normal modal logic corresponding to a class of Kripke frames definable by a set of formulas called strict universal Horn formulas.

Bi-intuitionistic implication structures

  • D. Skurt
  • Philosophy
    J. Appl. Non Class. Logics
  • 2018
This contribution will present some results concerning the connectives of bi-intuitionistic logic in the setting of Arnold Koslow’s implication structures and soundness and completeness results of Koslow's implication structures with respect to bi- Intuitionist logic.