English
Related papers

Related papers: Herbrand's Fundamental Theorem - an encyclopedia a…

200 papers

First-Order Logic (FOL) is widely regarded as one of the most important foundations for knowledge representation. Nevertheless, in this paper, we argue that FOL has several critical issues for this purpose. Instead, we propose an…

Artificial Intelligence · Computer Science 2017-05-01 Yi Zhou

This article revisits standard theorems from elementary number theory from a constructive, algorithmic, and proof-theoretic perspective, framed within the theory of computable functionals TCF. Key examples include B\'ezout's identity, the…

Logic · Mathematics 2026-05-25 Franziskus Wiesnet

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

Logic in Computer Science · Computer Science 2012-10-10 Jakub Michaliszyn , Jan Otop , Piotr Witkowski

The minimization of the length of syntactic dependencies is a well-established principle of word order and the basis of a mathematical theory of word order. Here we complete that theory from the perspective of information theory, adding a…

Computation and Language · Computer Science 2017-09-05 Ramon Ferrer-i-Cancho

Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…

Artificial Intelligence · Computer Science 2020-12-22 Angelos Charalambidis , Giorgos Papadimitriou , Panos Rondogiannis , Antonis Troumpoukis

The most important problems for society are describable only in vague terms, dependent on subjective positions, and missing highly relevant data. This thesis is intended to revive and further develop the view that giving non-trivial,…

Logic in Computer Science · Computer Science 2018-09-27 Robert Dustin Wehr

These are lecture notes from a course I gave at the University of Wisconsin during the Spring semester of 1993. Part 1 is concerned with Borel hierarchies. Section 13 contains an unpublished theorem of Fremlin concerning Borel hierarchies…

Logic · Mathematics 2009-09-25 Arnold Miller

In this paper, proof of the {\it Kurlberg-Rudnick supremum conjecture} for the quantum Hannay-Berry model is presented. This conjecture was stated in P. Kurlberg's lectures at Bologna 2001 and Tel-Aviv 2003. The proof is a primer…

Mathematical Physics · Physics 2007-05-23 Shamgar Gurevich , Ronny Hadani

A predicate head is a verbal expression that plays a role as the structural center of a sentence. Identifying predicate heads is critical to understanding a sentence. It plays the leading role in organizing the relevant syntactic elements…

Computation and Language · Computer Science 2021-04-02 Yanping Chen , Wenfan Jin , Yongbin Qin , Ruizhang Huang , Qinghua Zheng , Ping Chen

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

Formal Languages and Automata Theory · Computer Science 2022-09-08 L. Schaeffer , J. Shallit

We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the…

Logic in Computer Science · Computer Science 2016-11-01 Robert Constable , Mark Bickford

This survey is meant to provide an introduction to the fundamental theorem of linear algebra and the theories behind them. Our goal is to give a rigorous introduction to the readers with prior exposure to linear algebra. Specifically, we…

Machine Learning · Computer Science 2022-07-29 Jun Lu

For relational monadic formulas (the L\"owenheim class) second-order quantifier elimination, which is closely related to computation of uniform interpolants, projection and forgetting - operations that currently receive much attention in…

Logic in Computer Science · Computer Science 2017-12-20 Christoph Wernhard

Let $G$ be a semisimple, simply connected algebraic group defined and split over a prime field ${\mathbb F}_p$ of positive characteristic. For a positive integer $r$, let $G_r$ be the $r$th Frobenius kernel of $G$. Let $Q$ be a projective…

Representation Theory · Mathematics 2012-12-04 Brian Parshall , Leonard Scott

Possibilistic logic is a well-known graded logic of uncertainty suitable to reason under incomplete information and partially inconsistent knowledge, which is built upon classical first order logic. There exists for Possibilistic logic a…

Artificial Intelligence · Computer Science 2013-01-31 Teresa Alsinet , Lluis Godo , Sandra Sandri

Tarski's semantic definition of truth is the composition of its extensional and intensional aspects. Abstract satisfaction, the core of the semantic definition of truth, is the basis for the theory of institutions (Goguen and Burstall). The…

Logic in Computer Science · Computer Science 2018-11-07 Robert E. Kent

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

Logic in Computer Science · Computer Science 2023-06-22 Arnon Avron , Liron Cohen

The construction of first-order logic and set theory gives rise to apparent circularities of mutual dependence, making it unclear which can act as a self-contained starting point in the foundation of mathematics. In this paper, we carry out…

Logic · Mathematics 2023-12-27 J. Julian Pulgarín , Andrés F. Uribe-Zapata

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

Determinism is (roughly) the thesis that the past determines the future. But efforts to define it precisely have exposed deep methodological disagreements. Standard possible-worlds formulations of determinism presuppose an "agreement"…

History and Philosophy of Physics · Physics 2026-01-19 Hans Halvorson , JB Manchak , James Owen Weatherall