Results for 'guarded logics'

997 found
Order:
  1.  8
    Party Contributions From Non-Classical Logics.Contributions From Non-Classical Logics - 2004 - In S. Rahman J. Symons (ed.), Logic, Epistemology, and the Unity of Science. Kluwer Academic Publisher. pp. 457.
  2.  22
    Deciding Regular Grammar Logics with Converse Through First-Order Logic.Stéphane Demri & Hans De Nivelle - 2005 - Journal of Logic, Language and Information 14 (3):289-329.
    We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic. The translation is theoretically interesting because it translates modal logics with certain frame conditions into first-order logic, without explicitly expressing the frame conditions. It is practically relevant because it makes it possible to use a decision procedure for the guarded fragment in order to decide (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  12
    Guarded Quantification in Least Fixed Point Logic.Gregory McColm - 2004 - Journal of Logic, Language and Information 13 (1):61-110.
    We develop a variant of Least Fixed Point logic based on First Orderlogic with a relaxed version of guarded quantification. We develop aGame Theoretic Semantics of this logic, and find that under reasonableconditions, guarding quantification does not reduce the expressibilityof Least Fixed Point logic. But we also find that the guarded version ofa least fixed point algorithm may have a greater time complexity thanthe unguarded version, by a linear factor.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  4.  43
    Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures.Ian Hodkinson & Martin Otto - 2003 - Bulletin of Symbolic Logic 9 (3):387-405.
    We provide a canonical construction of conformal covers for finite hypergraphs and present two immediate applications to the finite model theory of relational structures. In the setting of relational structures, conformal covers serve to construct guarded bisimilar companion structures that avoid all incidental Gaifman cliques-thus serving as a partial analogue in finite model theory for the usually infinite guarded unravellings. In hypergraph theoretic terms, we show that every finite hypergraph admits a bisimilar cover by a finite conformal hypergraph. (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  5. Propositional Epistemic Logics with Quantification Over Agents of Knowledge.Gennady Shtakser - 2018 - Studia Logica 106 (2):311-344.
    The paper presents a family of propositional epistemic logics such that languages of these logics are extended by quantification over modal operators or over agents of knowledge and extended by predicate symbols that take modal operators as arguments. Denote this family by \}\). There exist epistemic logics whose languages have the above mentioned properties :311–350, 1995; Lomuscio and Colombetti in Proceedings of ATAL 1996. Lecture Notes in Computer Science, vol 1193, pp 71–85, 1996). But these logics (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  12
    Some Model Theory of Guarded Negation.Vince Bárány, Michael Benedikt & Balder ten Cate - 2018 - Journal of Symbolic Logic 83 (4):1307-1344.
    The Guarded Negation Fragment is a fragment of first-order logic that contains all positive existential formulas, can express the first-order translations of basic modal logic and of many description logics, along with many sentences that arise in databases. It has been shown that the syntax of GNFO is restrictive enough so that computational problems such as validity and satisfiability are still decidable. This suggests that, in spite of its expressive power, GNFO formulas are amenable to novel optimizations. In (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  4
    Products of Modal Logics. Part 2: Relativised Quantifiers in Classical Logic.D. Gabbay & V. Shehtman - 2000 - Logic Journal of the IGPL 8 (2):165-210.
    In the first part of this paper we introduced products of modal logics and proved basic results on their axiomatisability and the f.m.p. In this continuation paper we prove a stronger result - the product f.m.p. holds for products of modal logics in which some of the modalities are reflexive or serial. This theorem is applied in classical first-order logic, we identify a new Square Fragment of the classical logic, where the basic predicates are binary and all quantifiers (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  9
    Propositional Epistemic Logics with Quantification Over Agents of Knowledge (An Alternative Approach).Gennady Shtakser - 2019 - Studia Logica 107 (4):753-780.
    In the previous paper with a similar title :311–344, 2018), we presented a family of propositional epistemic logics whose languages are extended by two ingredients: by quantification over modal operators or over agents of knowledge and by predicate symbols that take modal operators as arguments. We denoted this family by \}\). The family \}\) is defined on the basis of a decidable higher-order generalization of the loosely guarded fragment of first-order logic. And since HO-LGF is decidable, we obtain (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  70
    Semantical Analysis of Weak Kleene Logics.Roberto Ciuni & Massimiliano Carrara - 2019 - Journal of Applied Non-Classical Logics 29 (1):1-36.
    This paper presents a semantical analysis of the Weak Kleene Logics Kw3 and PWK from the tradition of Bochvar and Halldén. These are three-valued logics in which a formula takes the third value if at least one of its components does. The paper establishes two main results: a characterisation result for the relation of logical con- sequence in PWK – that is, we individuate necessary and sufficient conditions for a set.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10. Logics of Public Communications.Jan Plaza - 2007 - Synthese 158 (2):165 - 179.
    Multi-modal versions of propositional logics S5 or S4—commonly accepted as logics of knowledge—are capable of describing static states of knowledge but they do not reflect how the knowledge changes after communications among agents. In the present paper (part of broader research on logics of knowledge and communications) we define extensions of the logic S5 which can deal with public communications. The logics have natural semantics. We prove some completeness, decidability and interpretability results and formulate a general (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   124 citations  
  11.  49
    Possible-Translations Semantics for Some Weak Classically-Based Paraconsistent Logics.João Marcos - 2008 - Journal of Applied Non-Classical Logics 18 (1):7-28.
    In many real-life applications of logic it is useful to interpret a particular sentence as true together with its negation. If we are talking about classical logic, this situation would force all other sentences to be equally interpreted as true. Paraconsistent logics are exactly those logics that escape this explosive effect of the presence of inconsistencies and allow for sensible reasoning still to take effect. To provide reasonably intuitive semantics for paraconsistent logics has traditionally proven to be (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  12. A Road Map of Interval Temporal Logics and Duration Calculi.Valentin Goranko, Angelo Montanari & Guido Sciavicco - 2004 - Journal of Applied Non-Classical Logics 14 (1-2):9-54.
    We survey main developments, results, and open problems on interval temporal logics and duration calculi. We present various formal systems studied in the literature and discuss their distinctive features, emphasizing on expressiveness, axiomatic systems, and (un)decidability results.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  13.  53
    Modal Logics for Parallelism, Orthogonality, and Affine Geometries.Philippe Balbiani & Valentin Goranko - 2002 - Journal of Applied Non-Classical Logics 12 (3-4):365-397.
    We introduce and study a variety of modal logics of parallelism, orthogonality, and affine geometries, for which we establish several completeness, decidability and complexity results and state a number of related open, and apparently difficult problems. We also demonstrate that lack of the finite model property of modal logics for sufficiently rich affine or projective geometries (incl. the real affine and projective planes) is a rather common phenomenon.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  14.  60
    Judgement Aggregation in Non-Classical Logics.Daniele Porello - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):106-139.
    This work contributes to the theory of judgement aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgement aggregation to cope with non-classical logics, we discuss in particular results for the case of Intuitionistic Logic, the Lambek calculus, Linear Logic and Relevant Logics. The motivation for studying judgement aggregation in non-classical logics is that they offer a number of modelling choices to represent agents’ reasoning in aggregation problems. By studying judgement (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  15.  16
    Finite and Infinite-Valued Logics: Inference, Algebra and Geometry: Preface.Walter Carnielli - 1999 - Journal of Applied Non-Classical Logics 9 (1):7-8.
    This is the preface for a special volume published by the Journal of Applied Non-Classical Logics Volume 9, Issue 1, 1999.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  16.  44
    Non-Deterministic Algebraization of Logics by Swap Structures.Marcelo E. Coniglio, Aldo Figallo-Orellano & Ana Claudia Golzio - forthcoming - Logic Journal of the IGPL.
    Multialgebras (or hyperalgebras or non-deterministic algebras) have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several Logics of Formal Inconsistency (or LFIs) that cannot be semantically characterized by a single finite matrix. In particular, these LFIs are not algebraizable by the standard tools of abstract algebraic logic. In this paper, the first steps towards a theory of non-deterministic algebraization (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  17.  31
    First-Order Swap Structures Semantics for Some Logics of Formal Inconsistency.Marcelo E. Coniglio - manuscript
    The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  18. A Universal Logic Approach to Adaptive Logics.Diderik Batens - 2007 - Logica Universalis 1 (1):221-242.
    . In this paper, adaptive logics are studied from the viewpoint of universal logic (in the sense of the study of common structures of logics). The common structure of a large set of adaptive logics is described. It is shown that this structure determines the proof theory as well as the semantics of the adaptive logics, and moreover that most properties of the logics can be proved by relying solely on the structure, viz. without invoking (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   46 citations  
  19.  69
    Logics of Nonsense and Parry Systems.Thomas Macaulay Ferguson - 2015 - Journal of Philosophical Logic 44 (1):65-80.
    We examine the relationship between the logics of nonsense of Bochvar and Halldén and the containment logics in the neighborhood of William Parry’s A I. We detail two strategies for manufacturing containment logics from nonsense logics—taking either connexive and paraconsistent fragments of such systems—and show how systems determined by these techniques have appeared as Frederick Johnson’s R C and Carlos Oller’s A L. In particular, we prove that Johnson’s system is precisely the intersection of Bochvar’s B (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  20.  99
    Modal Languages and Bounded Fragments of Predicate Logic.Hajnal Andréka, István Németi & Johan van Benthem - 1998 - Journal of Philosophical Logic 27 (3):217 - 274.
    What precisely are fragments of classical first-order logic showing “modal” behaviour? Perhaps the most influential answer is that of Gabbay 1981, which identifies them with so-called “finite-variable fragments”, using only some fixed finite number of variables (free or bound). This view-point has been endorsed by many authors (cf. van Benthem 1991). We will investigate these fragments, and find that, illuminating and interesting though they are, they lack the required nice behaviour in our sense. (Several new negative results support this claim.) (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   58 citations  
  21. Conjunction and Disjunction in Infectious Logics.Hitoshi Omori & Damian Szmuc - 2017 - In Alexandru Baltag, Jeremy Seligman & Tomoyuki Yamada (eds.), Logic, Rationality, and Interaction (LORI 2017, Sapporo, Japan). Berlin: Springer. pp. 268-283.
    In this paper we discuss the extent to which conjunction and disjunction can be rightfully regarded as such, in the context of infectious logics. Infectious logics are peculiar many-valued logics whose underlying algebra has an absorbing or infectious element, which is assigned to a compound formula whenever it is assigned to one of its components. To discuss these matters, we review the philosophical motivations for infectious logics due to Bochvar, Halldén, Fitting, Ferguson and Beall, noticing that (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  22. Towards a Philosophical Understanding of the Logics of Formal Inconsistency.Walter Carnielli & Abílio Rodrigues - 2015 - Manuscrito 38 (2):155-184.
    In this paper we present a philosophical motivation for the logics of formal inconsistency, a family of paraconsistent logics whose distinctive feature is that of having resources for expressing the notion of consistency within the object language in such a way that consistency may be logically independent of non-contradiction. We defend the view according to which logics of formal inconsistency may be interpreted as theories of logical consequence of an epistemological character. We also argue that in order (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  23.  79
    Swap Structures Semantics for Ivlev-Like Modal Logics.Marcelo E. Coniglio & Ana Claudia Golzio - forthcoming - Soft Computing.
    In 1988, J. Ivlev proposed some (non-normal) modal systems which are semantically characterized by four-valued non-deterministic matrices in the sense of A. Avron and I. Lev. Swap structures are multialgebras (a.k.a. hyperalgebras) of a special kind, which were introduced in 2016 by W. Carnielli and M. Coniglio in order to give a non-deterministic semantical account for several paraconsistent logics known as logics of formal inconsistency, which are not algebraizable by means of the standard techniques. Each swap structure induces (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  54
    Constraints for Input/Output Logics.David Makinson & Leendert van der Torre - 2001 - Journal of Philosophical Logic 30 (2):155 - 185.
    In a previous paper we developed a general theory of input/output logics. These are operations resembling inference, but where inputs need not be included among outputs, and outputs need not be reusable as inputs. In the present paper we study what happens when they are constrained to render output consistent with input. This is of interest for deontic logic, where it provides a manner of handling contrary-to-duty obligations. Our procedure is to constrain the set of generators of the input/output (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   35 citations  
  25.  32
    Institutional Antecedents of Partnering for Social Change: How Institutional Logics Shape Cross—Sector Social Partnerships. [REVIEW]Clodia Vurro, M. Tina Dacin & Francesco Perrini - 2010 - Journal of Business Ethics 94 (1):39-53.
    Heeding the call for a deeper understanding of how cross-sector social partnerships can be managed across different contexts, this article integrates ideas from institutional theory with current debate on cross-boundary collaboration. Adopting the point of view of business actors interested in forming a CSSP to address complex social problems, we suggest that "appropriateness" needs shape business approaches toward partnering for social change, exerting an impact on the benefits that can be gained from it. A theoretical framework is proposed that identifies (...)
    Direct download (4 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   16 citations  
  26. LP, K3, and FDE as Substructural Logics.Lionel Shapiro - 2017 - In Pavel Arazim & Tomáš Lavička (eds.), The Logica Yearbook 2016. London: College Publications.
    Building on recent work, I present sequent systems for the non-classical logics LP, K3, and FDE with two main virtues. First, derivations closely resemble those in standard Gentzen-style systems. Second, the systems can be obtained by reformulating a classical system using nonstandard sequent structure and simply removing certain structural rules (relatives of exchange and contraction). I clarify two senses in which these logics count as “substructural.”.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  27.  69
    Ideal Paraconsistent Logics.O. Arieli, A. Avron & A. Zamansky - 2011 - Studia Logica 99 (1-3):31-60.
    We define in precise terms the basic properties that an ‘ideal propositional paraconsistent logic’ is expected to have, and investigate the relations between them. This leads to a precise characterization of ideal propositional paraconsistent logics. We show that every three-valued paraconsistent logic which is contained in classical logic, and has a proper implication connective, is ideal. Then we show that for every n > 2 there exists an extensive family of ideal n -valued logics, each one of which (...)
    Direct download (6 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   12 citations  
  28.  43
    Proofs and Countermodels in Non-Classical Logics.Sara Negri - 2014 - Logica Universalis 8 (1):25-60.
    Proofs and countermodels are the two sides of completeness proofs, but, in general, failure to find one does not automatically give the other. The limitation is encountered also for decidable non-classical logics in traditional completeness proofs based on Henkin’s method of maximal consistent sets of formulas. A method is presented that makes it possible to establish completeness in a direct way: For any given sequent either a proof in the given logical system or a countermodel in the corresponding frame (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  29.  27
    Implicational (Semilinear) Logics I: A New Hierarchy. [REVIEW]Petr Cintula & Carles Noguera - 2010 - Archive for Mathematical Logic 49 (4):417-446.
    In abstract algebraic logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this process one considers the Leibniz relation of indiscernible formulae. Such approach has resulted in a classification of logics partly based on generalizations of equivalence connectives: the Leibniz hierarchy. This paper performs an analogous abstract study of non-classical logics based on the kind of generalized implication connectives they possess. It yields a new classification of (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  30.  67
    Multimo Dal Logics of Products of Topologies.Johan van Benthem, Guram Bezhanishvili, Balder ten Cate & Darko Sarenac - 2006 - Studia Logica 84 (3):369-392.
    We introduce the horizontal and vertical topologies on the product of topological spaces, and study their relationship with the standard product topology. We show that the modal logic of products of topological spaces with horizontal and vertical topologies is the fusion ${\bf S4}\oplus {\bf S4}$ . We axiomatize the modal logic of products of spaces with horizontal, vertical, and standard product topologies. We prove that both of these logics are complete for the product of rational numbers ${\Bbb Q}\times {\Bbb (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  31.  33
    The Interrogative Model of Inquiry Meets Dynamic Epistemic Logics.Yacin Hamami - 2015 - Synthese 192 (6):1609-1642.
    The Interrogative Model of Inquiry and Dynamic Epistemic Logics are two central paradigms in formal epistemology. This paper is motivated by the observation of a significant complementarity between them: on the one hand, the IMI provides a framework for investigating inquiry represented as an idealized game between an Inquirer and Nature, along with an account of the interaction between questions and inferences in information-seeking processes, but is lacking a formulation in the multi-agent case; on the other hand, DELs model (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  32.  71
    Intermediate Logics and Visser's Rules.Rosalie Iemhoff - 2005 - Notre Dame Journal of Formal Logic 46 (1):65-81.
    Visser's rules form a basis for the admissible rules of . Here we show that this result can be generalized to arbitrary intermediate logics: Visser's rules form a basis for the admissible rules of any intermediate logic for which they are admissible. This implies that if Visser's rules are derivable for then has no nonderivable admissible rules. We also provide a necessary and sufficient condition for the admissibility of Visser's rules. We apply these results to some specific intermediate (...) and obtain that Visser's rules form a basis for the admissible rules of, for example, De Morgan logic, and that Dummett's logic and the propositional Gödel logics do not have nonderivable admissible rules. (shrink)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  33. Ontology and Medical Terminology: Why Description Logics Are Not Enough.Werner Ceusters, Barry Smith & Jim Flanagan - 2003 - In Proceedings of the Conference: Towards an Electronic Patient Record (TEPR 2003). Boston, MA: Medical Records Institute.
    Ontology is currently perceived as the solution of first resort for all problems related to biomedical terminology, and the use of description logics is seen as a minimal requirement on adequate ontology-based systems. Contrary to common conceptions, however, description logics alone are not able to prevent incorrect representations; this is because they do not come with a theory indicating what is computed by using them, just as classical arithmetic does not tell us anything about the entities that are (...)
    Direct download  
     
    Export citation  
     
    Bookmark   10 citations  
  34. Weakly Algebraizable Logics.Janusz Czelakowski & Ramon Jansana - 2000 - Journal of Symbolic Logic 65 (2):641-668.
    In the paper we study the class of weakly algebraizable logics, characterized by the monotonicity and injectivity of the Leibniz operator on the theories of the logic. This class forms a new level in the non-linear hierarchy of protoalgebraic logics.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  35. On the Philosophical Motivations for the Logics of Formal Consistency and Inconsistency.Walter Carnielli & Rodrigues Abilio - manuscript
    We present a philosophical motivation for the logics of formal inconsistency, a family of paraconsistent logics whose distinctive feature is that of having resources for expressing the notion of consistency within the object language. We shall defend the view according to which logics of formal inconsistency are theories of logical consequence of normative and epistemic character. This approach not only allows us to make inferences in the presence of contradictions, but offers a philosophically acceptable account of paraconsistency.
    Direct download  
     
    Export citation  
     
    Bookmark  
  36.  32
    On Extensions of Intermediate Logics by Strong Negation.Marcus Kracht - 1998 - Journal of Philosophical Logic 27 (1):49-73.
    In this paper we will study the properties of the least extension n(Λ) of a given intermediate logic Λ by a strong negation. It is shown that the mapping from Λ to n(Λ) is a homomorphism of complete lattices, preserving and reflecting finite model property, frame-completeness, interpolation and decidability. A general characterization of those constructive logics is given which are of the form n(Λ). This summarizes results that can be found already in [13, 14] and [4]. Furthermore, we determine (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  37. On Algorithmic Properties of Propositional Inconsistency-Adaptive Logics.Sergei P. Odintsov & Stanislav O. Speranski - 2012 - Logic and Logical Philosophy 21 (3):209-228.
    The present paper is devoted to computational aspects of propositional inconsistency-adaptive logics. In particular, we prove (relativized versions of) some principal results on computational complexity of derivability in such logics, namely in cases of CLuN r and CLuN m , i.e., CLuN supplied with the reliability strategy and the minimal abnormality strategy, respectively.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38. On the Restraining Power of Guards.Erich Grädel - 1999 - Journal of Symbolic Logic 64 (4):1719-1742.
    Guarded fragments of first-order logic were recently introduced by Andreka, van Benthem and Nemeti; they consist of relational first-order formulae whose quantifiers are appropriately relativized by atoms. These fragments are interesting because they extend in a natural way many propositional modal logics, because they have useful model-theoretic properties and especially because they are decidable classes that avoid the usual syntactic restrictions (on the arity of relation symbols, the quantifier pattern or the number of variables) of almost all other (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  39.  76
    Maximality in Finite-Valued Lukasiewicz Logics Defined by Order Filters.Marcelo E. Coniglio, Francesc Esteva, Joan Gispert & Lluis Godo - forthcoming - Journal of Logic and Computation.
  40.  67
    Actuality, Tableaux, and Two-Dimensional Modal Logics.Fabio Lampert - 2018 - Erkenntnis 83 (3):403-443.
    In this paper we present tableau methods for two-dimensional modal logics. Although models for such logics are well known, proof systems remain rather unexplored as most of their developments have been purely axiomatic. The logics herein considered contain first-order quantifiers with identity, and all the formulas in the language are doubly-indexed in the proof systems, with the upper indices intuitively representing the actual or reference worlds, and the lower indices representing worlds of evaluation—first and second dimensions, respectively. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  41.  89
    Adaptive Logics Using the Minimal Abnormality Strategy Are P 1 1 \Pi^1_1 -Complex.Peter Verdée - 2009 - Synthese 167 (1):93 - 104.
    In this article complexity results for adaptive logics using the minimal abnormality strategy are presented. It is proven here that the consequence set of some recursive premise sets is $\Pi _1^1 - complete$ . So, the complexity results in (Horsten and Welch, Synthese 158:41–60,2007) are mistaken for adaptive logics using the minimal abnormality strategy.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  42. A Routley-Meyer Semantics for Ackermann's Logics of “Strenge Implication”.José M. Méndez - 2009 - Logic and Logical Philosophy 18 (3-4):191-219.
    The aim of this paper is to provide a Routley-Meyer semantics for Ackermann’s logics of “strenge Implikation” Π ′ and Π ′′ . Besides the Disjunctive Syllogism, this semantics validates the rules Necessitation and Assertion. Strong completeness theorems for Π ′ and Π ′′ are proved. A brief discussion on Π ′ , Π ′′ and paraconsistency is included.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43.  56
    Hierarchies of Modal and Temporal Logics with Reference Pointers.Valentin Goranko - 1996 - Journal of Logic, Language and Information 5 (1):1-24.
    We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: point of reference-reference pointer which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive systems. For instance, Kamp's and (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  44. Quantified Multimodal Logics in Simple Type Theory.Christoph Benzmüller & Lawrence C. Paulson - 2013 - Logica Universalis 7 (1):7-20.
    We present an embedding of quantified multimodal logics into simple type theory and prove its soundness and completeness. A correspondence between QKπ models for quantified multimodal logics and Henkin models is established and exploited. Our embedding supports the application of off-the-shelf higher-order theorem provers for reasoning within and about quantified multimodal logics. Moreover, it provides a starting point for further logic embeddings and their combinations in simple type theory.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  45.  35
    A Closer Look at Some Subintuitionistic Logics.Sergio Celani & Ramon Jansana - 2001 - Notre Dame Journal of Formal Logic 42 (4):225-255.
    In the present paper we study systematically several consequence relations on the usual language of propositional intuitionistic logic that can be defined semantically by using Kripke frames and the same defining truth conditions for the connectives as in intuitionistic logic but without imposing some of the conditions on the Kripke frames that are required in the intuitionistic case. The logics so obtained are called subintuitionistic logics in the literature. We depart from the perspective of considering a logic just (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  46. Inconsistency-Adaptive Modal Logics. On How to Cope with Modal Inconsistency.Hans Lycke - 2010 - Logic and Logical Philosophy 19 (1-2):31-61.
    In this paper, I will characterize a new class of inconsistency-adaptive logics, namely inconsistency-adaptive modal logics. These logics cope with inconsistencies in a modal context. More specifically, when faced with inconsistencies, inconsistency-adaptive modal logics avoid explosion, but still allow the derivation of sufficient consequences to adequately explicate the part of human reasoning they are intended for.
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47.  87
    New Dimensions on Translations Between Logics.Walter A. Carnielli, Marcelo E. Coniglio & Itala M. L. D’Ottaviano - 2009 - Logica Universalis 3 (1):1-18.
    After a brief promenade on the several notions of translations that appear in the literature, we concentrate on three paradigms of translations between logics: ( conservative ) translations , transfers and contextual translations . Though independent, such approaches are here compared and assessed against questions about the meaning of a translation and about comparative strength and extensibility of a logic with respect to another.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   8 citations  
  48. Towards an Hyperalgebraic Theory of Non-Algebraizable Logics.Marcelo E. Coniglio, Aldo Figallo-Orellano & Ana C. Golzio - 2016 - CLE E-Prints 16 (4):1-27.
    Multialgebras (or hyperalgebras) have been very much studied in the literature. In the realm of Logic, they were considered by Avron and his collaborators under the name of non-deterministic matrices (or Nmatrices) as a useful semantics tool for characterizing some logics (in particular, several logics of formal inconsistency or LFIs) which cannot be characterized by a single finite matrix. In particular, these LFIs are not algebraizable by any method, including Blok and Pigozzi general theory. Carnielli and Coniglio introduced (...)
     
    Export citation  
     
    Bookmark   1 citation  
  49.  78
    Fibring Non-Truth-Functional Logics: Completeness Preservation.C. Caleiro, W. A. Carnielli, M. E. Coniglio, A. Sernadas & C. Sernadas - 2003 - Journal of Logic, Language and Information 12 (2):183-211.
    Fibring has been shown to be useful for combining logics endowed withtruth-functional semantics. However, the techniques used so far are unableto cope with fibring of logics endowed with non-truth-functional semanticsas, for example, paraconsistent logics. The first main contribution of thepaper is the development of a suitable abstract notion of logic, that mayalso encompass systems with non-truth-functional connectives, and wherefibring can still be dealt with. Furthermore, it is shown that thisextended notion of fibring preserves completeness under certain reasonableconditions. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  50.  47
    On the Rules of Intermediate Logics.Rosalie Iemhoff - 2006 - Archive for Mathematical Logic 45 (5):581-599.
    If the Visser rules are admissible for an intermediate logic, they form a basis for the admissible rules of the logic. How to characterize the admissible rules of intermediate logics for which not all of the Visser rules are admissible is not known. In this paper we give a brief overview of results on admissible rules in the context of intermediate logics. We apply these results to some well-known intermediate logics. We provide natural examples of logics (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
1 — 50 / 997