This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

16513 found
Order:
1 — 50 / 16513
Material to categorize
  1. More Observations.Paul Merriam - manuscript
    Anthropic principle, Perspectival ontology, Hard problem, Why something rather than nothing, Life after death, Buddhism, God.
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  2. A Description Logic Based Knowledge Representation Model for Concept Understanding.Farshad Badie - 2017 - In Jasper van den Herik, A. Rocha & J. Filipe (eds.), Agents and Artificial Intelligence. Cham, Switzerland: Springer.
    This research employs Description Logics in order to focus on logical description and analysis of the phenomenon of ‘concept understanding’. The article will deal with a formal-semantic model for figuring out the underlying logical assumptions of ‘concept understanding’ in knowledge representation systems. In other words, it attempts to describe a theoretical model for concept understanding and to reflect the phenomenon of ‘concept understanding’ in terminological knowledge representation systems. Finally, it will design an ontology that schemes the structure of concept understanding (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  3. Modelling Last-Act Attempted Crime in Criminal Law.Jiraporn Pooksook, Phan Minh Dung, Ken Satoh & Giovanni Sartor - 2019 - Journal of Applied Non-Classical Logics 29 (4):327-357.
    In the court of law, a person can be punished for attempting to commit a crime. An open issue in the study of Artificial Intelligence and Law is whether the law of attempts could be formally modelled. There are distinct legal rules for determining attempted crime whereas the last-act rule (also called proximity rule) represents the strictest approach. In this paper, we provide a formal model of the last-act rule using structured argumentation.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  4. Varieties of BL-Algebras III: Splitting Algebras.Paolo Aglianó - 2019 - Studia Logica 107 (6):1235-1259.
    In this paper we investigate splitting algebras in varieties of logics, with special consideration for varieties of BL-algebras and similar structures. In the case of the variety of all BL-algebras a complete characterization of the splitting algebras is obtained.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5. The Balanced Pseudocomplemented Ockham Algebras with the Strong Endomorphism Kernel Property.Jie Fang - 2019 - Studia Logica 107 (6):1261-1277.
    An endomorphism on an algebra \ is said to be strong if it is compatible with every congruence on \; and \ is said to have the strong endomorphism kernel property if every congruence on \, other than the universal congruence, is the kernel of a strong endomorphism on \. Here we characterise the structure of Ockham algebras with balanced pseudocomplementation those that have this property via Priestley duality.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. Completeness in Equational Hybrid Propositional Type Theory.Maria Manzano, Manuel Martins & Antonia Huertas - 2019 - Studia Logica 107 (6):1159-1198.
    Equational hybrid propositional type theory ) is a combination of propositional type theory, equational logic and hybrid modal logic. The structures used to interpret the language contain a hierarchy of propositional types, an algebra and a Kripke frame. The main result in this paper is the proof of completeness of a calculus specifically defined for this logic. The completeness proof is based on the three proofs Henkin published last century: Completeness in type theory, The completeness of the first-order functional calculus (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7. Lyndon Interpolation Theorem of Instantial Neighborhood Logic – Constructively Via a Sequent Calculus.Junhua Yu - 2020 - Annals of Pure and Applied Logic 171 (1):102721.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8. Polarity Semantics for Negation as a Modal Operator.Yuanlei Lin & Minghui Ma - forthcoming - Studia Logica:1-26.
    The minimal weakening \ of Belnap-Dunn logic under the polarity semantics for negation as a modal operator is formulated as a sequent system which is characterized by the class of all birelational frames. Some extensions of \ with additional sequents as axioms are introduced. In particular, all three modal negation logics characterized by a frame with a single state are formalized as extensions of \. These logics have the finite model property and they are decidable.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9. A Family of Neighborhood Contingency Logics.Jie Fan - 2019 - Notre Dame Journal of Formal Logic 60 (4):683-699.
    This article proposes the axiomatizations of contingency logics of various natural classes of neighborhood frames. In particular, by defining a suitable canonical neighborhood function, we give sound and complete axiomatizations of monotone contingency logic and regular contingency logic, thereby answering two open questions raised by Bakhtiari, van Ditmarsch, and Hansen. The canonical function is inspired by a function proposed by Kuhn in 1995. We show that Kuhn’s function is actually equal to a related function originally given by Humberstone.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10. Noncontractive Classical Logic.Lucas Rosenblatt - 2019 - Notre Dame Journal of Formal Logic 60 (4):559-585.
    One of the most fruitful applications of substructural logics stems from their capacity to deal with self-referential paradoxes, especially truth-theoretic paradoxes. Both the structural rules of contraction and the rule of cut play a crucial role in typical paradoxical arguments. In this paper I address a number of difficulties affecting noncontractive approaches to paradox that have been discussed in the recent literature. The situation was roughly this: if you decide to go substructural, the nontransitive approach to truth offers a lot (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11. Satisfiability is False Intuitionistically: A Question From Dana Scott.Charles McCarty - forthcoming - Studia Logica:1-11.
    Satisfiability or Sat\ is the metatheoretic statementEvery formally intuitionistically consistent set of first-order sentences has a model.The models in question are the Tarskian relational structures familiar from standard first-order model theory, but here treated within intuitionistic metamathematics. We prove that both IZF, intuitionistic Zermelo–Fraenkel set theory, and HAS, second-order Heyting arithmetic, prove Sat\ to be false outright. Following the lead of Carter :75–95, 2008), we then generalize this result to some provably intermediate first-order logics, including the Rose logic. These metatheorems (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12. Oppositional Geometry in the Diagrammatic Calculus CL.Jens Lemanski - 2017 - South American Journal of Logic 3 (2):517-531.
    The paper presents the diagrammatic calculus CL, which combines features of tree, Euler-type, Venn-type diagrams and squares of opposition. In its basic form, `CL' (= Cubus Logicus) organizes terms in the form of a square or cube. By applying the arrows of the square of opposition to CL, judgments and inferences can be displayed. Thus CL offers on the one hand an intuitive method to display ontologies and on the other hand a diagrammatic tool to check inferences. The paper focuses (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  13. Modal Logic with Non-Deterministic Semantics: Part I—Propositional Case.Marcelo E. Coniglio & Luis Fariñas del Cerro - forthcoming - Logic Journal of the IGPL.
    Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices (which he called quasi-matrices), in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the (T) axiom was replaced by the deontic (D) axiom. In this paper, we (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  14. Three Characterizations of Strict Coherence on Infinite-Valued Events.Tommaso Flaminio - forthcoming - Review of Symbolic Logic:1-18.
    This article builds on a recent paper coauthored by the present author, H. Hosni and F. Montagna. It is meant to contribute to the logical foundations of probability theory on many-valued events and, specifically, to a deeper understanding of the notion of strict coherence. In particular, we will make use of geometrical, measure-theoretical and logical methods to provide three characterizations of strict coherence on formulas of infinite-valued Łukasiewicz logic.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15. The Modal Logic of Set-Theoretic Potentialism and the Potentialist Maximality Principles.Joel David Hamkins & Øystein Linnebo - forthcoming - Review of Symbolic Logic:1-36.
  16. An Epistemic Approach to Nondeterminism: Believing in the Simplest Course of Events.James P. Delgrande & Hector J. Levesque - 2019 - Studia Logica 107 (5):859-886.
    This paper describes an approach for reasoning in a dynamic domain with nondeterministic actions in which an agent’s beliefs correspond to the simplest, or most plausible, course of events consistent with the agent’s observations and beliefs. The account is based on an epistemic extension of the situation calculus, a first-order theory of reasoning about action that accommodates sensing actions. In particular, the account is based on a qualitative theory of nondeterminism. Our position is that for commonsense reasoning, the world is (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17. Categories with Families and First-Order Logic with Dependent Sorts.Erik Palmgren - 2019 - Annals of Pure and Applied Logic 170 (12):102715.
    First-order logic with dependent sorts, such as Makkai's first-order logic with dependent sorts (FOLDS), or Aczel's and Belo's dependently typed (intuitionistic) first-order logic (DFOL), may be regarded as logic enriched dependent type theories. Categories with families (cwfs) is an established semantical structure for dependent type theories, such as Martin-Löf type theory. We introduce in this article a notion of hyperdoctrine over a cwf, and show how FOLDS and DFOL fit in this semantical framework. A soundness and completeness theorem is proved (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18. Understanding Predication in Conceptual Spaces.Daniele Porello & Claudio Masolo - 2016 - In Roberta Ferrario & Werner Kuhn (eds.), Formal Ontology in Information Systems. Proceedings of the Ninth International Conference (FOIS 2016). pp. 139--152.
    We argue that a cognitive semantics has to take into account the possibly partial information that a cognitive agent has of the world. After discussing Gärdenfors's view of objects in conceptual spaces, we offer a number of viable treatments of partiality of information and we formalize them by means of alternative predicative logics. Our analysis shows that understanding the nature of simple predicative sentences is crucial for a cognitive semantics.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  19. Representing Concepts by Weighted Formulas.Daniele Porello & Claudio Masolo - 2018 - In Stefano Borgo, Pascal Hitzler & Oliver Kutz (eds.), Formal Ontology in Information Systems - Proceedings of the 10th International Conference, {FOIS} 2018, Cape Town, South Africa, 19-21 September 2018. IOS Press. pp. 55--68.
    A concept is traditionally defined via the necessary and sufficient conditions that clearly determine its extension. By contrast, cognitive views of concepts intend to account for empirical data that show that categorisation under a concept presents typicality effects and a certain degree of indeterminacy. We propose a formal language to compactly represent concepts by leveraging on weighted logical formulas. In this way, we can model the possible synergies among the qualities that are relevant for categorising an object under a concept. (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  20. End of the Square?Fabien Schang - forthcoming - South American Journal of Logic 4 (2):1-21.
    It has been recently argued that the well-known square of opposition is a gathering that can be reduced to a one-dimensional figure, an ordered line segment of positive and negative integers [3]. However, one-dimensionality leads to some difficulties once the structure of opposed terms extends to more complex sets. An alternative algebraic semantics is proposed to solve the problem of dimensionality in a systematic way, namely: partition (or bitstring) semantics. Finally, an alternative geometry yields a new and unique pattern of (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  21. Lennart Âqvist. Reflections on the Logic of Nonsense. Theoria , Vol. 28 , Pp. 138–157. - Krister Segerberg. A Contribution to Nonsense-Logics. Theoria , Vol. 31 , Pp. 199–217. [REVIEW]E. E. Dawson - 1968 - Journal of Symbolic Logic 33 (1):134-136.
  22. Lennart Âqvist. Reflections on the Logic of Nonsense. Theoria , Vol. 28 , Pp. 138–157. - Krister Segerberg. A Contribution to Nonsense-Logics. Theoria , Vol. 31 , Pp. 199–217. [REVIEW]E. E. Dawson - 1968 - Journal of Symbolic Logic 33 (1):134-136.
  23. Lennart Âqvist. A New Approach to the Logical Theory of Interrogatives. Part I. Analysis. Filosofiska Föreningen I Uppsala, Uppsala1965, Iv + 174 Pp. [REVIEW]David Harrah - 1967 - Journal of Symbolic Logic 32 (3):403-404.
  24. Lennart Âqvist. A New Approach to the Logical Theory of Interrogatives. Part I. Analysis. Filosofiska Föreningen I Uppsala, Uppsala1965, Iv + 174 Pp. [REVIEW]David Harrah - 1967 - Journal of Symbolic Logic 32 (3):403-404.
  25. Keith Lehrer and Richard Taylor. Time, Truth and Modalities. Mind, N.S. Vol. 74 , Pp. 390–398.A. N. Prior - 1967 - Journal of Symbolic Logic 32 (3):401-402.
  26. Keith Lehrer and Richard Taylor. Time, Truth and Modalities. Mind, N.S. Vol. 74 , Pp. 390–398.A. N. Prior - 1967 - Journal of Symbolic Logic 32 (3):401-402.
  27. M. A. E. Dummett and E. J. Lemmon. Modal Logics Between S4 and S5. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 5 , Pp. 250–264. - Iwao Nishimura. On Formulas of One Variable in Intuitionistic Propositional Calculus. The Journal of Symbolic Logic, Vol. 25 No. 4 , Pp. 327–331. - D. C. Makinson. There Are Infinitely Many Diodorean Modal Functions. The Journal of Symbolic Logic, Vol. 31 , Pp. 406–408. [REVIEW]A. N. Prior - 1967 - Journal of Symbolic Logic 32 (3):396-397.
  28. M. A. E. Dummett and E. J. Lemmon. Modal Logics Between S4 and S5. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 5 , Pp. 250–264. - Iwao Nishimura. On Formulas of One Variable in Intuitionistic Propositional Calculus. The Journal of Symbolic Logic, Vol. 25 No. 4 , Pp. 327–331. - D. C. Makinson. There Are Infinitely Many Diodorean Modal Functions. The Journal of Symbolic Logic, Vol. 31 , Pp. 406–408. [REVIEW]A. N. Prior - 1967 - Journal of Symbolic Logic 32 (3):396-397.
  29. Georg Kreisel and William W. Tait. Finite Definability of Number-Theoretic Functions and Parametric Completeness of Equational Calculi. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 7 , Pp. 28–38. [REVIEW]Rohit Parikh - 1967 - Journal of Symbolic Logic 32 (2):270-271.
  30. Lawrence Wos, George A. Robinson, and Daniel F. Carson. Efficiency and Completeness of the Set of Support Strategy in Theorem Proving. Journal of the Association for Computing Machinery, Vol. 12 , Pp. 536–541. [REVIEW]David Luckham - 1967 - Journal of Symbolic Logic 32 (1):117-118.
  31. Lawrence Wos, George A. Robinson, and Daniel F. Carson. Efficiency and Completeness of the Set of Support Strategy in Theorem Proving. Journal of the Association for Computing Machinery, Vol. 12 , Pp. 536–541. [REVIEW]David Luckham - 1967 - Journal of Symbolic Logic 32 (1):117-118.
  32. Martin Davis, George Logemann, and Donald Loveland. A Machine Program for Theorem-Proving. Communications of the ACM, Vol. 5 , Pp. 394–397. [REVIEW]J. A. Robinson - 1967 - Journal of Symbolic Logic 32 (1):118.
  33. Martin Davis, George Logemann, and Donald Loveland. A Machine Program for Theorem-Proving. Communications of the ACM, Vol. 5 , Pp. 394–397. [REVIEW]J. A. Robinson - 1967 - Journal of Symbolic Logic 32 (1):118.
  34. Lawrence Wos, Daniel Carson, and George Robinson. The Unit Preference Strategy in Theorem Proving. AFIPS Conference Proceedings, Volume 26, 1964 Fall Joint Computer Conference, Spartan Books, Inc., Baltimore, Md., and Cleaver-Hume Press, London, 1964, Pp. 615–621. [REVIEW]David Luckham - 1967 - Journal of Symbolic Logic 32 (1):117.
  35. Lawrence Wos, Daniel Carson, and George Robinson. The Unit Preference Strategy in Theorem Proving. AFIPS Conference Proceedings, Volume 26, 1964 Fall Joint Computer Conference, Spartan Books, Inc., Baltimore, Md., and Cleaver-Hume Press, London, 1964, Pp. 615–621. [REVIEW]David Luckham - 1967 - Journal of Symbolic Logic 32 (1):117.
  36. Norman M. Martin. Note on the Completeness of Decision Element Sets. The Journal of Computing Systems, Vol. 1 No. 4 , P. 220. [REVIEW]Alonzo Church - 1967 - Journal of Symbolic Logic 32 (1):134.
  37. Norman M. Martin. Note on the Completeness of Decision Element Sets. The Journal of Computing Systems, Vol. 1 No. 4 , P. 220. [REVIEW]Alonzo Church - 1967 - Journal of Symbolic Logic 32 (1):134.
  38. Andrzej Mostowski. Concerning the Problem of Axiomatizability of the Field of Real Numbers in the Weak Second Order Logic. Essays on the Foundations of Mathematics, Dedicated to A. A. Fraenkel on His Seventieth Anniversary, Edited by Y. Bar-Hillel, E. I. J. Poznanski, M. O. Rabin, and A. Robinson for The Hebrew University of Jerusalem, Magnes Press, Jerusalem 1961, and North-Holland Publishing Company, Amsterdam1962, Pp. 269–286. [REVIEW]Raphael M. Robinson - 1967 - Journal of Symbolic Logic 32 (1):130-131.
  39. Andrzej Mostowski. Concerning the Problem of Axiomatizability of the Field of Real Numbers in the Weak Second Order Logic. Essays on the Foundations of Mathematics, Dedicated to A. A. Fraenkel on His Seventieth Anniversary, Edited by Y. Bar-Hillel, E. I. J. Poznanski, M. O. Rabin, and A. Robinson for The Hebrew University of Jerusalem, Magnes Press, Jerusalem 1961, and North-Holland Publishing Company, Amsterdam1962, Pp. 269–286. [REVIEW]Raphael M. Robinson - 1967 - Journal of Symbolic Logic 32 (1):130-131.
  40. Ralph M. Toms. Systems of Boolean Equations. The American Mathematical Monthly, Vol. 73 , Pp. 29–35.William Wernick - 1967 - Journal of Symbolic Logic 32 (1):132-133.
  41. Ralph M. Toms. Systems of Boolean Equations. The American Mathematical Monthly, Vol. 73 , Pp. 29–35.William Wernick - 1967 - Journal of Symbolic Logic 32 (1):132-133.
  42. M. J. Cresswell. On the Logic of Incomplete Answers. The Journal of Symbolic Logic, Vol. 30 , Pp. 65–68.Gerold Stahl - 1966 - Journal of Symbolic Logic 31 (3):498.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  43. Jaakko Hintikka. Distributive Normal Forms in First-Order Logic. Formal Systems and Recursive Functions, Proceedings of the Eighth Logic Colloquium, Oxford, July 1963, Edited by J. N. Crossley and M. A. E. Dummett, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Company, Amsterdam1965, Pp. 48–91. - Jaakko Hintikka. Distributive Normal Forms and Deductive Interpolation. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 10 , Pp. 185–191. [REVIEW]F. C. Oglesby - 1966 - Journal of Symbolic Logic 31 (2):267-268.
  44. Jaakko Hintikka. Distributive Normal Forms in First-Order Logic. Formal Systems and Recursive Functions, Proceedings of the Eighth Logic Colloquium, Oxford, July 1963, Edited by J. N. Crossley and M. A. E. Dummett, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Company, Amsterdam1965, Pp. 48–91. - Jaakko Hintikka. Distributive Normal Forms and Deductive Interpolation. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 10 , Pp. 185–191. [REVIEW]F. C. Oglesby - 1966 - Journal of Symbolic Logic 31 (2):267-268.
  45. Rudolf Carnap. Introduction to Symbolic Logic and its Applications. Englische Übersetzung der XX 274 von William H. Meyer Und John Wilkinson. Dover Publications, Inc., New York1958, Xiv + 241 S. [REVIEW]H. Hermes - 1966 - Journal of Symbolic Logic 31 (2):287.
  46. Rudolf Carnap. Introduction to Symbolic Logic and its Applications. Englische Übersetzung der XX 274 von William H. Meyer Und John Wilkinson. Dover Publications, Inc., New York1958, Xiv + 241 S. [REVIEW]H. Hermes - 1966 - Journal of Symbolic Logic 31 (2):287.
  47. Jaakko Hintikka. Modality and Quantification. Theoria , Vol. 27 , Pp. 119–128. - Jaakko Hintikka. The Modes of Modality. Proceedings of a Colloquium on Modal and Many-Valued Logics, Helsinki, 23–26 August, 1962, Acta Philosophica Fennica, No. 16, Helsinki 1963, Pp. 65–81. [REVIEW]W. B. Pitt - 1966 - Journal of Symbolic Logic 31 (1):122-123.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  48. V. I. Šéstákov. Pérfohartočnyj Métod Sintéza Mnogotaktnyh Sistém Mnogopozicionnyh Rélé . Avtomatika I Téléméhanika, Vol. 20 , Pp. 1496–1506. [REVIEW]Andrzej Harland - 1966 - Journal of Symbolic Logic 31 (1):140-140.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  49. Ewa Orlowska and Joanna Golinska-Pilarek, Dual Tableaux: Foundations, Methodology, Case Studies, Springer, Series: Trends in Logic, Vol. 33, 2011, Pp. Xvi+523, 113 Illus. ISBN: 978-94-007-0004-8 EURO 181,85, 978-94-007-0005-5 EURO 159,99. [REVIEW]Walter Carnielli - 2013 - Studia Logica 101 (1):229-232.
  50. William H. Hanson. On Some Alleged Decision Procedures for S4. The Journal of Symbolic Logic, Vol. 31 , Pp. 641–643.A. Bayart - 1970 - Journal of Symbolic Logic 35 (2):326.
1 — 50 / 16513