Classical System of Martin-Lof's Inductive Definitions is not Equivalent to Cyclic Proofs [PDF]
Logical Methods in Computer Science, 2019 A cyclic proof system, called CLKID-omega, gives us another way of representing inductive definitions and efficient proof search. The 2005 paper by Brotherston showed that the provability of CLKID-omega includes the provability of LKID, first order ...
Stefano Berardi, Makoto Tatsuta
doaj +3 more sources
Incremental Control Synthesis in Probabilistic Environments with Temporal Logic Constraints [PDF]
IEEE Conference on Decision and Control, 2012 In this paper, we present a method for optimal control synthesis of a plant that interacts with a set of agents in a graph-like environment. The control specification is given as a temporal logic statement about some properties that hold at the vertices ...
Belta, Calin +2 more
core +4 more sources
Unpacking the logic of mathematical statements [PDF]
Educational Studies in Mathematics, 1995 This study focuses on undergraduate students' ability to unpack informally written mathematical statements into the language of predicate calculus. Data were collected between 1989 and 1993 from 61 students in six small sections of a “bridge” course designed to introduce proofs and mathematical reasoning.
Selden, John, Selden, Annie
openaire +3 more sources
Logic-level Evidence Retrieval and Graph-based Verification Network for Table-based Fact Verification [PDF]
Conference on Empirical Methods in Natural Language Processing, 2021 Table-based fact verification task aims to verify whether the given statement is supported by the given semi-structured table. Symbolic reasoning with logical operations plays a crucial role in this task.
Qi Shi, Yu Zhang, Qingyu Yin, Ting Liu
semanticscholar +1 more source
LOREN: Logic-Regularized Reasoning for Interpretable Fact Verification [PDF]
AAAI Conference on Artificial Intelligence, 2020 Given a natural language statement, how to verify its veracity against a large-scale textual knowledge source like Wikipedia? Most existing neural models make predictions without giving clues about which part of a false claim goes wrong.
Jiangjie Chen +7 more
semanticscholar +1 more source
On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable formulas.
Federico Aschieri
doaj +1 more source
Muslim Logicians on Quantification of Predicate vs. Hamilton’s View [PDF]
حکمت و فلسفه, 2018 According to Muslim logicians, the quantifier, in categorical logic, shows the quantity of the individuals of the subject in a statement; so its place is before the subject.
Seyyed Mohammad Ali Hodjati
doaj +1 more source
Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic [PDF]
Logical Methods in Computer Science, 2019 We show that on graphs with n vertices, the 2-dimensional Weisfeiler-Leman algorithm requires at most O(n^2/log(n)) iterations to reach stabilization. This in particular shows that the previously best, trivial upper bound of O(n^2) is asymptotically not ...
Sandra Kiefer, Pascal Schweitzer
doaj +1 more source
Deductive Systems in Traditional and Modern Logic
Axioms, 2020 Since its inception, logic has studied the acceptable rules of reasoning, the rules that allow us to pass from certain statements, serving as premises or assumptions, to a statement taken as a conclusion [...]
Alex Citkin +1 more
doaj +1 more source
The Marginal Reality of Humor [PDF]
Гуманитарный вектор, 2021 The relevance of the work is due to the presence of a contradiction between the prevalence of humor, its ubiquity and ubiquity in social reality and its rather weak research as a phenomenon of this social reality.
Marina G. Fedotova
doaj +1 more source