Switch to: References

Add citations

You must login to add citations.
  1. Conservative Translations Revisited.J. Ramos, J. Rasga & C. Sernadas - 2023 - Journal of Philosophical Logic 52 (3):889-913.
    We provide sufficient conditions for the existence of a conservative translation from a consequence system to another one. We analyze the problem in many settings, namely when the consequence systems are generated by a deductive calculus or by a logic system including both proof-theoretic and model-theoretic components. We also discuss reflection of several metaproperties with the objective of showing that conservative translations provide an alternative to proving such properties from scratch. We discuss soundness and completeness, disjunction property and metatheorem of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Categorical Abstract Algebraic Logic: More on Protoalgebraicity.George Voutsadakis - 2006 - Notre Dame Journal of Formal Logic 47 (4):487-514.
    Protoalgebraic logics are characterized by the monotonicity of the Leibniz operator on their theory lattices and are at the lower end of the Leibniz hierarchy of abstract algebraic logic. They have been shown to be the most primitive among those logics with a strong enough algebraic character to be amenable to algebraic study techniques. Protoalgebraic π-institutions were introduced recently as an analog of protoalgebraic sentential logics with the goal of extending the Leibniz hierarchy from the sentential framework to the π-institution (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)Categorical Abstract Algebraic Logic: Referential π-Institutions.George Voutsadakis - 2015 - Bulletin of the Section of Logic 44 (1/2):33-51.
    Wojcicki introduced in the late 1970s the concept of a referential semantics for propositional logics. Referential semantics incorporate features of the Kripke possible world semantics for modal logics into the realm of algebraic and matrix semantics of arbitrary sentential logics. A well-known theorem of Wojcicki asserts that a logic has a referential semantics if and only if it is selfextensional. Referential semantics was subsequently studied in detail by Malinowski and the concept of selfextensionality has played, more recently, an important role (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Categorical Abstract Algebraic Logic: Behavioral π-Institutions.George Voutsadakis - 2014 - Studia Logica 102 (3):617-646.
    Recently, Caleiro, Gon¸calves and Martins introduced the notion of behaviorally algebraizable logic. The main idea behind their work is to replace, in the traditional theory of algebraizability of Blok and Pigozzi, unsorted equational logic with multi-sorted behavioral logic. The new notion accommodates logics over many-sorted languages and with non-truth-functional connectives. Moreover, it treats logics that are not algebraizable in the traditional sense while, at the same time, shedding new light to the equivalent algebraic semantics of logics that are algebraizable according (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Categorical Abstract Algebraic Logic: Prealgebraicity and Protoalgebraicity.George Voutsadakis - 2007 - Studia Logica 85 (2):215-249.
    Two classes of π are studied whose properties are similar to those of the protoalgebraic deductive systems of Blok and Pigozzi. The first is the class of N-protoalgebraic π-institutions and the second is the wider class of N-prealgebraic π-institutions. Several characterizations are provided. For instance, N-prealgebraic π-institutions are exactly those π-institutions that satisfy monotonicity of the N-Leibniz operator on theory systems and N-protoalgebraic π-institutions those that satisfy monotonicity of the N-Leibniz operator on theory families. Analogs of the correspondence property of (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Categorical abstract algebraic logic: The largest theory system included in a theory family.George Voutsadakis - 2006 - Mathematical Logic Quarterly 52 (3):288-294.
    In this note, it is shown that, given a π -institution ℐ = 〈Sign, SEN, C 〉, with N a category of natural transformations on SEN, every theory family T of ℐ includes a unique largest theory system equation image of ℐ. equation image satisfies the important property that its N -Leibniz congruence system always includes that of T . As a consequence, it is shown, on the one hand, that the relation ΩN = ΩN characterizes N -protoalgebraicity inside the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Categorical Abstract Algebraic Logic: Truth-Equational $pi$-Institutions.George Voutsadakis - 2015 - Notre Dame Journal of Formal Logic 56 (2):351-378.
    Finitely algebraizable deductive systems were introduced by Blok and Pigozzi to capture the essential properties of those deductive systems that are very tightly connected to quasivarieties of universal algebras. They include the equivalential logics of Czelakowski. Based on Blok and Pigozzi’s work, Herrmann defined algebraizable deductive systems. These are the equivalential deductive systems that are also truth-equational, in the sense that the truth predicate of the class of their reduced matrix models is explicitly definable by some set of unary equations. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Categorical Abstract Algebraic Logic: Algebraic Semantics for (documentclass{article}usepackage{amssymb}begin{document}pagestyle{empty}$bf{pi }$end{document})‐Institutions.George Voutsadakis - 2013 - Mathematical Logic Quarterly 59 (3):177-200.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Categorical abstract algebraic logic: The Diagram and the Reduction Operator Lemmas.George Voutsadakis - 2007 - Mathematical Logic Quarterly 53 (2):147-161.
    The study of structure systems, an abstraction of the concept of first-order structures, is continued. Structure systems have algebraic systems as their algebraic reducts and their relational component consists of a collection of relation systems on the underlying functors. An analog of the expansion of a first-order structure by constants is presented. Furthermore, analogs of the Diagram Lemma and the Reduction Operator Lemma from the theory of equality-free first-order structures are provided in the framework of structure systems. (© 2007 WILEY-VCH (...)
    Download  
     
    Export citation  
     
    Bookmark