English
Related papers

Related papers: Aristotle's Second-Order Logic and Natural Deducti…

200 papers

Following the results and the general methodological framework of a preceeding paper (Models and Metaphors, part I, henceforth: MM), we develop some results on the epistemological state of natural laws and ask for explicit possibilities of…

Adaptation and Self-Organizing Systems · Physics 2016-09-08 R. E. Zimmermann , A. Schlemm , D. Zeilinger , V. G. Budanov , V. E. Voitsekhovitch

In the concluding remarks of Ontological Promiscuity Hobbs (1985) made what we believe to be a very insightful observation: given that semantics is an attempt at specifying the relation between language and the world, if "one can assume a…

Computation and Language · Computer Science 2019-04-16 Walid S. Saba

Logics of limited belief aim at enabling computationally feasible reasoning in highly expressive representation languages. These languages are often dialects of first-order logic with a weaker form of logical entailment that keeps reasoning…

Artificial Intelligence · Computer Science 2017-05-05 Christoph Schwering

Standard epistemic logics introduce a modal operator K to represent knowledge, but in doing so they presuppose the logical apparatus they aim to explain. By contrast, this paper explores how logic may be derived from the structure of…

Logic in Computer Science · Computer Science 2025-12-01 Alexader V. Gheorghiu , Tao Gu

We study the expressive power of fragments of inclusion and independence logic defined either by restricting the number of universal quantifiers or the arity of inclusion and independence atoms in formulas. Assuming the so-called lax…

Logic · Mathematics 2013-04-17 Pietro Galliani , Miika Hannula , Juha Kontinen

Convincing someone of the truth value of a premise requires understanding and articulating the core logical structure of the argument which proves or disproves the premise. Understanding the logical structure of an argument refers to…

Computation and Language · Computer Science 2025-08-21 Krunal Shah , Dan Roth

This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually polynomial-time reducible to their fragments with at most two…

Logic in Computer Science · Computer Science 2025-12-30 Mikhail Rybakov

We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…

Logic in Computer Science · Computer Science 2015-07-30 Charles Paperman

The definition is a common form of human expert knowledge, a building block of formal science and mathematics, a foundation for database theory and is supported in various forms in many knowledge representation and formal specification…

Logic in Computer Science · Computer Science 2017-02-16 Marc Denecker , Bart Bogaerts , Joost Vennekens

The fundamental aim of the paper is to correct an harmful way to interpret a Goedel's erroneous remark at the Congress of Koenigsberg in 1930. Despite the Goedel's fault is rather venial, its misreading has produced and continues to produce…

History and Overview · Mathematics 2022-09-15 Giuseppe Raguni

Ontologies often require knowledge representation on multiple levels of abstraction, but description logics (DLs) are not well-equipped for supporting this. We propose an extension of DLs in which abstraction levels are first-class citizens…

Artificial Intelligence · Computer Science 2023-10-23 Carsten Lutz , Lukas Schulze

Principia Logico-Metaphysica contains a foundational logical theory for metaphysics, mathematics, and the sciences. It includes a canonical development of Abstract Object Theory [AOT], a metaphysical theory (inspired by ideas of Ernst…

Logic in Computer Science · Computer Science 2019-07-25 Daniel Kirchner , Christoph Benzmüller , Edward N. Zalta

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

Logic in Computer Science · Computer Science 2015-05-22 Andreas Teucke , Christoph Weidenbach

This paper concerns an expansion of first-order Belnap-Dunn logic whose connectives and quantifiers all have a counterpart in classical logic. The language and logical consequence relation of this paradefinite logic are defined, a sequent…

Logic in Computer Science · Computer Science 2026-03-04 C. A. Middelburg

The paper introduces a basic logic of knowledge and abduction by extending Levesque logic of only-knowing with an abduction modal operator defined via the combination of basic epistemic concepts. The upshot is an alternative approach to…

Artificial Intelligence · Computer Science 2026-01-09 Sanderson Molick , Vaishak Belle

With help of a compact Prolog-based theorem prover for Intuitionistic Propositional Logic, we synthesize minimal assumptions under which a given formula formula becomes a theorem. After applying our synthesis algorithm to cover basic…

Logic in Computer Science · Computer Science 2022-05-13 Paul Tarau

Contemporary semantic description of logic is based on the ontology of all possible interpretations, an insufficiently clear metaphysical concept. In this article, logic is described as the internal organization of language. Logical…

Logic · Mathematics 2024-08-23 Boris Čulina

In the last years the debate on complexity has been developing and developing in transdisciplinary way to meet the need of explanation for highly organized collective behaviors and sophisticated hierarchical arrangements in physical,…

General Physics · Physics 2010-04-26 Ignazio Licata

We suggest an ordering for the predicates in continuous logic so that the semantics of continuous logic can be formulated as a hyperdoctrine. We show that this hyperdoctrine can be embedded into the hyperdoctrine of subobjects of a suitable…

Logic · Mathematics 2021-07-23 Daniel Figueroa , Benno van den Berg

We present a syntactic abstraction method to reason about first-order modal logics by using theorem provers for standard first-order logic and for propositional modal logic.

Logic in Computer Science · Computer Science 2014-09-15 Damien Doligez , Jael Kriener , Leslie Lamport , Tomer Libal , Stephan Merz
‹ Prev 1 8 9 10 Next ›