David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 90 (2):263 - 286 (2008)
Defining a composition operation on sets of formulas one obtains a many-sorted algebra which satisfies the superassociative law and one more identity. This algebra is called the clone of formulas of the given type. The interpretations of formulas on an algebraic system of the same type form a many-sorted algebra with similar properties. The satisfaction of a formula by an algebraic system defines a Galois connection between classes of algebraic systems of the same type and collections of formulas. Hypersubstitutions are mappings sending pairs of operation symbols to pairs of terms of the corresponding arities and relation symbols to formulas of the same arities. Using hypersubstitutions we define hyperformulas. Satisfaction of a hyperformula by an algebraic system defines a second Galois connection between classes of algebraic systems of the same type and collections of formulas. A class of algebraic systems is said to be solid if every formula which is satisfied is also satisfied as a hyperformula. On the basis of these two Galois connections we construct a conjugate pair of additive closure operators and are able to characterize solid classes of algebraic systems.
|Keywords||Philosophy Computational Linguistics Mathematical Logic and Foundations Logic|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Lars Lindahl & Jan Odelstad (2003). Normative Systems and Their Revision: An Algebraic Approach. [REVIEW] Artificial Intelligence and Law 11 (2-3):81-104.
Dov M. Gabbay (1996). Labelled Deductive Systems. Oxford University Press.
Ludomir Newelski (1999). Geometry of *-Finite Types. Journal of Symbolic Logic 64 (4):1375-1395.
Janusz Czelakowski (1985). Algebraic Aspects of Deduction Theorems. Studia Logica 44 (4):369 - 387.
Anna Bucalo (1994). Modalities in Linear Logic Weaker Than the Exponential “of Course”: Algebraic and Relational Semantics. [REVIEW] Journal of Logic, Language and Information 3 (3):211-232.
M. Campercholi & D. Vaggione (2011). Algebraic Functions. Studia Logica 98 (1-2):285-306.
Tatjana L. Plotkin, Sarit Kraus & Boris I. Plotkin (1998). Problems of Equivalence, Categoricity of Axioms and States Description in Databases. Studia Logica 61 (3):347-366.
Guram Bezhanishvili & Nick Bezhanishvili (2011). An Algebraic Approach to Canonical Formulas: Modal Case. Studia Logica 99 (1-3):93-125.
Josep Maria Font, Ramon Jansana & Don Pigozzi (2006). On the Closure Properties of the Class of Full G-Models of a Deductive System. Studia Logica 83 (1-3):215 - 278.
W. J. Blok & J. Rebagliato (2003). Algebraic Semantics for Deductive Systems. Studia Logica 74 (1-2):153 - 180.
Added to index2009-01-28
Total downloads22 ( #170,747 of 1,796,259 )
Recent downloads (6 months)9 ( #85,027 of 1,796,259 )
How can I increase my downloads?