• Corpus ID: 52232235

Sequent calculus as a programming language

  title={Sequent calculus as a programming language},
  author={Zoran Ognjanovi and Bukar Gaji and Radomir S. Stankovi and Paola Glavan and Bojan Marinkovi and Andre Scedrov and Mladen Vukovi},
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. 


Interpretability Logic
This is an overview a study of interpretability logic in Zagreb for the last twenty years: a brief history and some planes for further research. The idea of treating a provability predicate as a
The Expressive Power of Abstract-State Machines
  • W. Reisig
  • Mathematics
    Comput. Artif. Intell.
  • 2003
The Abstract-State Machine model is characterized as a special class of transition systems that widely extends the class of "computable" transition systems.
A Constructive Algebraic Hierarchy in Coq
A framework of algebraic structures in the proof assistant Coq is described, in which a constructive proof of the fundamental theorem of algebra has been formalized in Coq by applying a combination of labelled record types and coercions.
The interpretability logic ILF
A characteristic class of ILsetframes for the principle F is determined and it is proved that the principle P is not provable in the system ILF.
Sequential abstract-state machines capture sequential algorithms
Analysis of the postulates leads to the notion of sequential abstract-state machine and to the theorem in the title.
Semigroups with apartness
A constructive version of the Spectral Mapping Theorem is proved using a constructive semigroup with inequality and the primary objective is to prove isomorphism theorems for such constructive semigroups.
Distributed Algorithms: A Case Study of the Java Memory Model
A mathematically precise specification of the Java memory model and its interpretation in the ASM context is given and it is shown how each thread in a multithreaded Java program can be seen as an ordinary interactive small-step algorithm, and, consequently, how the Java program gives rise to a distributed ordinary interactivesmall-step ASM.
The bakery algorithm: yet another specification and verification
An instructive proof which uses lower and higher views to show correctness of Lamport’s bakery algorithm is given and two evolving algebras are constructed enabling a simple and concise proof of correctness for the bakery algorithm.
Apartness and Uniformity - A Constructive Development
This book presents a theory of apartness encompassing both point-set topology and the theory of uniform spaces. The first book on the apartness approach to constructive topology, it is a valuable