Studia Logica 59 (3):359-386 (1997)
|Abstract||Annotated logics were introduced by V.S. Subrahmanian as logical foundations for computer programming. One of the difficulties of these systems from the logical point of view is that they are not structural, i.e., their consequence relations are not closed under substitutions. In this paper we give systems of annotated logics that are equivalent to those of Subrahmanian in the sense that everything provable in one type of system has a translation that is provable in the other. Moreover these new systems are structural. We prove that these systems are weakly congruential, namely, they have an infinite system of congruence 1-formulas. Moreover, we prove that an annotated logic is algebraizable (i.e., it has a finite system of congruence formulas,) if and only if the lattice of annotation constants is finite.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
D. M. Gabbay (1996). Fibred Semantics and the Weaving of Logics Part 1: Modal and Intuitionistic Logics. Journal of Symbolic Logic 61 (4):1057-1120.
Burghard Herrmann (1997). Characterizing Equivalential and Algebraizable Logics by the Leibniz Operator. Studia Logica 58 (2):305-323.
Ramon Jansana (2006). Selfextensional Logics with a Conjunction. Studia Logica 84 (1):63 - 104.
Costas Drossos & Daniele Mundici (2000). Many-Valued Points and Equality. Synthese 125 (1-2):77-95.
Ewa Orlowska (1992). Relational Proof System for Relevant Logics. Journal of Symbolic Logic 57 (4):1425-1440.
Itala M. Loffredo D'Ottaviano & Hércules de A. Feitosa (2000). Paraconsistent Logics and Translations. Synthese 125 (1/2):77 - 95.
R. A. Lewin, I. F. Mikenberg & M. G. Schwarze (2000). Algebras and Matrices for Annotated Logics. Studia Logica 65 (1):137-153.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #274,982 of 549,520 )
Recent downloads (6 months)0
How can I increase my downloads?