Interpretability of First—Order Dynamic Logic in a Relational Calculus

Frias, Marcelo F.; Baum, Gabriel; Maibaum, Tom

doi:10.1007/3-540-36280-0_5

Search citation statements

Order By: Relevance

Paper Sections

Select...

Definition 28 (Proof Calculus [2])1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2006

2019

Publication Types

Select...

Book3

Article1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…11] the formalisation of natural deduction for first-order logic requires the use of multicategories [2,Def. 10], in [34, §3] the formalisation of the proof calculus for ω-closure fork algebras with urelements [35,Def. 7] (a variant of fork algebras [36,37] with a reflexive and transitive closure operator) requires the use of strict monoidal categories [29, Ch.…”

Section: Definition 28 (Proof Calculus [2])mentioning

confidence: 99%

Satisfiability Calculus: An Abstract Formulation of Semantic Proof Systems

Pombo

Castro

Aguirre

et al. 2019

View full text Add to dashboard Cite

The theory of institutions, introduced by Goguen and Burstall in 1984, can be thought of as an abstract formulation of model theory. This theory has been shown to be particularly useful in computer science, as a mathematical foundation for formal approaches to software construction. Institution theory was extended by a number of researchers, José Meseguer among them, who, in 1989, presented General Logics, wherein the model theoretical view of institutions

show abstract

Section: Definition 28 (Proof Calculus [2])mentioning

confidence: 99%