Corpus ID: 52232235

Sequent calculus as a programming language

@inproceedings{Ognjanovi2017SequentCA,
  title={Sequent calculus as a programming language},
  author={Zoran Ognjanovi and B. Gaji and Radomir S. Stankovi and Paola Glavan and B. Marinkovi and A. Scedrov and Mladen Vukovi},
  year={2017}
}
  • Zoran Ognjanovi, B. Gaji, +4 authors Mladen Vukovi
  • Published 2017
  • A singular logical consequence relation is a closure operator on a set of sentences. A multiple logical consequence relation is not. We argue that the multiple one is more natural. We also discuss singular and multiple logical consequence relations generated by rules of inferences and their characterization theorems. We o er an explanation of Tarski's "more general" de nition of logical consequence generated by rules of inferences. 

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 24 REFERENCES
    Sequential abstract-state machines capture sequential algorithms
    • 459
    • Highly Influential
    • Open Access
    A Constructive Algebraic Hierarchy in Coq
    • 61
    • Open Access
    The Expressive Power of Abstract-State Machines
    • 27
    • Open Access
    Evolving algebras 1993: Lipari guide
    • 857
    • Highly Influential
    • Open Access
    The bakery algorithm: yet another specification and verification
    • 61
    • Open Access
    The interpretability logic ILF
    • 3
    Realizing public announcements by justifications
    • 27
    • Open Access
    Semigroups with apartness
    • 16
    Using lightweight modeling to understand chord
    • 80
    • Open Access
    ABSTRACT STATE MACHINES..A METHOD FOR HIGH-LEVEL SYSTEM DESIGN AND ANALYSIS
    • 80
    • Highly Influential
    • Open Access