Switch to: Citations

Add references

You must login to add references.
  1. Indexical knowledge and robot action—a logical account.Yves Lespérance & Hector J. Levesque - 1995 - Artificial Intelligence 73 (1-2):69-115.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Modal Boolean Connexive Logics: Semantics and Tableau Approach.Tomasz Jarmużek & Jacek Malinowski - 2019 - Bulletin of the Section of Logic 48 (3):213-243.
    In this paper we investigate Boolean connexive logics in a language with modal operators: □, ◊. In such logics, negation, conjunction, and disjunction behave in a classical, Boolean way. Only implication is non-classical. We construct these logics by mixing relating semantics with possible worlds. This way, we obtain connexive counterparts of basic normal modal logics. However, most of their traditional axioms formulated in terms of modalities and implication do not hold anymore without additional constraints, since our implication is weaker than (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • (1 other version)Connexive logics. An overview and current trends.Hitoshi Omori & Heinrich Wansing - forthcoming - Logic and Logical Philosophy:1.
    In this introduction, we offer an overview of main systems developed in the growing literature on connexive logic, and also point to a few topics that seem to be collecting attention of many of those interested in connexive logic. We will also make clear the context to which the papers in this special issue belong and contribute.
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Dynamic Logic.Lenore D. Zuck & David Harel - 1989 - Journal of Symbolic Logic 54 (4):1480.
    Download  
     
    Export citation  
     
    Bookmark   157 citations  
  • HYPE: A System of Hyperintensional Logic.Hannes Leitgeb - 2019 - Journal of Philosophical Logic 48 (2):305-405.
    This article introduces, studies, and applies a new system of logic which is called ‘HYPE’. In HYPE, formulas are evaluated at states that may exhibit truth value gaps and truth value gluts. Simple and natural semantic rules for negation and the conditional operator are formulated based on an incompatibility relation and a partial fusion operation on states. The semantics is worked out in formal and philosophical detail, and a sound and complete axiomatization is provided both for the propositional and the (...)
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • $${\in_K}$$ : a Non-Fregean Logic of Explicit Knowledge.Steffen Lewitzka - 2011 - Studia Logica 97 (2):233-264.
    We present a new logic-based approach to the reasoning about knowledge which is independent of possible worlds semantics. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\in_K}$$\end{document} is a non-Fregean logic whose models consist of propositional universes with subsets for true, false and known propositions. Knowledge is, in general, not closed under rules of inference; the only valid epistemic principles are the knowledge axiom Kiφ → φ and some minimal conditions concerning common knowledge in a group. Knowledge is explicit (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • 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.) (...)
    Download  
     
    Export citation  
     
    Bookmark   99 citations  
  • Expressivity of second order propositional modal logic.Balder ten Cate - 2006 - Journal of Philosophical Logic 35 (2):209-223.
    We consider second-order propositional modal logic (SOPML), an extension of the basic modal language with propositional quantifiers introduced by Kit Fine in 1970. We determine the precise expressive power of SOPML by giving analogues of the Van Benthem–Rosen theorem and the Goldblatt Thomason theorem. Furthermore, we show that the basic modal language is the bisimulation invariant fragment of SOPML, and we characterize the bounded fragment of first-order logic as being the intersection of first-order logic and SOPML.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Loosely guarded fragment of first-order logic has the finite model property.Ian Hodkinson - 2002 - Studia Logica 70 (2):205 - 240.
    We show that the loosely guarded and packed fragments of first-order logic have the finite model property. We use a construction of Herwig and Hrushovski. We point out some consequences in temporal predicate logic and algebraic logic.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • 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 known decidable (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Hyperintensional logic.M. J. Cresswell - 1975 - Studia Logica 34 (1):25 - 38.
    Download  
     
    Export citation  
     
    Bookmark   73 citations  
  • Representability in second-order propositional poly-modal logic.G. Aldo Antonelli & Richmond H. Thomason - 2002 - Journal of Symbolic Logic 67 (3):1039-1054.
    A propositional system of modal logic is second-order if it contains quantifiers ∀p and ∃p, which, in the standard interpretation, are construed as ranging over sets of possible worlds (propositions). Most second-order systems of modal logic are highly intractable; for instance, when augmented with propositional quantifiers, K, B, T, K4 and S4 all become effectively equivalent to full second-order logic. An exception is S5, which, being interpretable in monadic second-order logic, is decidable.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • 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 the decidability (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)The Slingshot Argument and Sentential Identity.Yaroslav Shramko & Heinrich Wansing - 2009 - Studia Logica 91 (3):429-455.
    The famous “slingshot argument” developed by Church, Gödel, Quine and Davidson is often considered to be a formally strict proof of the Fregean conception that all true sentences, as well as all false ones, have one and the same denotation, namely their corresponding truth value: the true or the false . In this paper we examine the analysis of the slingshot argument by means of a non-Fregean logic undertaken recently by A.Wóitowicz and put to the test her claim that the (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Non-Fregean Propositional Logic with Quantifiers.Joanna Golińska-Pilarek & Taneli Huuskonen - 2016 - Notre Dame Journal of Formal Logic 57 (2):249-279.
    We study the non-Fregean propositional logic with propositional quantifiers, denoted by $\mathsf{SCI}_{\mathsf{Q}}$. We prove that $\mathsf{SCI}_{\mathsf{Q}}$ does not have the finite model property and that it is undecidable. We also present examples of how to interpret in $\mathsf{SCI}_{\mathsf{Q}}$ various mathematical theories, such as the theory of groups, rings, and fields, and we characterize the spectra of $\mathsf{SCI}_{\mathsf{Q}}$-sentences. Finally, we present a translation of $\mathsf{SCI}_{\mathsf{Q}}$ into a classical two-sorted first-order logic, and we use the translation to prove some model-theoretic properties of (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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 are obtained from first-order (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Truth Values. Part I.Yaroslav Shramko & Heinrich Wansing - 2009 - Studia Logica 91 (3):429-455.
    The famous “slingshot argument” developed by Church, Gödel, Quine and Davidson is often considered to be a formally strict proof of the Fregean conception that all true sentences, as well as all false ones, have one and the same denotation, namely their corresponding truth value: the true or the false. In this paper we examine the analysis of the slingshot argument by means of a non-Fregean logic undertaken recently by A.Wóitowicz and put to the test her claim that the slingshot (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Second-order propositional modal logic: Expressiveness and completeness results.Francesco Belardinelli, Wiebe van der Hoek & Louwe B. Kuijer - 2018 - Artificial Intelligence 263 (C):3-45.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Tolerance logic.Maarten Marx - 2001 - Journal of Logic, Language and Information 10 (3):353-374.
    We expand first order models with a tolerance relation on thedomain. Intuitively, two elements stand in this relation if they arecognitively close for the agent who holds the model. This simplenotion turns out to be very powerful. It leads to a semanticcharacterization of the guarded fragment of Andréka, van Benthemand Németi, and highlights the strong analogies between modallogic and this fragment. Viewing the resulting logic – tolerance logic– dynamically it is a resource-conscious information processingalternative to classical first order logic. The (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Expressivity of Second Order Propositional Modal Logic.Balder Cate - 2006 - Journal of Philosophical Logic 35 (2):209-223.
    We consider second-order propositional modal logic (SOPML), an extension of the basic modal language with propositional quantifiers introduced by Kit Fine in 1970. We determine the precise expressive power of SOPML by giving analogues of the Van Benthem–Rosen theorem and the Goldblatt Thomason theorem. Furthermore, we show that the basic modal language is the bisimulation invariant fragment of SOPML, and we characterize the bounded fragment of first-order logic as being the intersection of first-order logic and SOPML.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The Expressive Power of Second-Order Propositional Modal Logic.Michael Kaminski & Michael Tiomkin - 1996 - Notre Dame Journal of Formal Logic 37 (1):35-43.
    It is shown that the expressive power of second-order propositional modal logic whose modalities are S4.2 or weaker is the same as that of second-order predicate logic.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Identity connective and modality.Roman Suszko - 1971 - Studia Logica 27 (1):7-39.
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Ability and knowing how in the situation calculus.Yves Lespérance, Hector J. Levesque, Fangzhen Lin & Richard B. Scherl - 2000 - Studia Logica 66 (1):165-186.
    Most agents can acquire information about their environments as they operate. A good plan for such an agent is one that not only achieves the goal, but is also executable, i.e., ensures that the agent has enough information at every step to know what to do next. In this paper, we present a formal account of what it means for an agent to know how to execute a plan and to be able to achieve a goal. Such a theory is (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations