From Kripke Models to Algebraic Counter-Valuations

@inproceedings{Negri1998FromKM,
  title={From Kripke Models to Algebraic Counter-Valuations},
  author={Sara Negri and Jan von Plato},
  booktitle={TABLEAUX},
  year={1998}
}
Starting with a derivation in the refutation calculus CRIP of Pinto and Dyckhoff, we give a constructive algebraic method for determining the values of formulas of intuitionistic propositional logic in a counter-model. The values of compound formulas are computed point-wise from the values on atoms, in contrast to the non-local determination of forcing relations in a Kripke model based on classical reasoning. 

Admissibility of structural rules for contraction-free systems of intuitionistic logic

This proof extends easily in the presence of quantifiers, in contrast to other, indirect, proofs, i.e., those which use induction on sequent weight or appeal to admissibility of rules in other calculi.

Sequent calculus proof theory of intuitionistic apartness and order relations

Contraction-free sequent calculi for intuitionistic theories of apartness and order are given and cut-elimination for the calculi proved and conservativity results for the theories of constructive order over the usual theories of order are extended.

Reasoning with Diagrams: Track Record

The team is ideally positioned to carry out the proposed programme of research, offering a combination of skills in diagrammatic reasoning, visual modelling, logic and automated reasoning, and tools for diagram manipulation and visualisation.

References

SHOWING 1-8 OF 8 REFERENCES

Sequent calculus proof theory of intuitionistic apartness and order relations

Contraction-free sequent calculi for intuitionistic theories of apartness and order are given and cut-elimination for the calculi proved and conservativity results for the theories of constructive order over the usual theories of order are extended.

Contraction-Free Sequent Calculi for Intuitionistic Logic

An equivalent calculus is described below, yet another variant on these systems, where the problem no longer arises: this gives a simple but effective decision procedure for IPC.

Basic proof theory

N- systems and H-systems and Gentzen systems, proof theory of arithmetic, second-order logic, and solutions to selected exercises.

Bounds for cut elimination in intuitionistic propositional logic

This article shall construct a (different) cut free deduction J(d) for the case of intuitionistic propositional logic and derive considerably sharper upper bounds for l(J(d)), and use the methods developed for this purpose in order to set up an effective decision method.

Intuitionistic logic, model theory and forcing

Positive Heyting algebras, manuscript

  • 1997