English
Related papers

Related papers: The Geometric Completion of a Doctrine

200 papers

The generation of complex derived word forms has been an overlooked problem in NLP; we fill this gap by applying neural sequence-to-sequence models to the task. We overview the theoretical motivation for a paradigmatic treatment of…

Computation and Language · Computer Science 2025-02-18 Ryan Cotterell , Ekaterina Vylomova , Huda Khayrallah , Christo Kirov , David Yarowsky

We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…

Formal Languages and Automata Theory · Computer Science 2024-10-09 Damien Pous , Jana Wagemaker

We study the relationship between cartesian bicategories and a specialisation of Lawvere's hyperdoctrines, namely elementary existential doctrines. Both provide different ways of abstracting the structural properties of logical systems: the…

Logic in Computer Science · Computer Science 2021-11-09 Filippo Bonchi , Alessio Santamaria , Jens Seeber , Paweł Sobociński

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…

Logic in Computer Science · Computer Science 2021-08-24 Johannes Marti

In this article, we present a fresh perspective on language, combining ideas from various sources, but mixed in a new synthesis. As in the minimalist program, the question is whether we can formulate an elegant formalism, a universal…

Computation and Language · Computer Science 2023-03-10 Loe Feijs

We advocate a declarative approach to proving properties of logic programs. Total correctness can be separated into correctness, completeness and clean termination; the latter includes non-floundering. Only clean termination depends on the…

Logic in Computer Science · Computer Science 2011-10-25 W. Drabent , M. Milkowska

For all classical groups (and for their analogs in infinite dimension or over general base fields or rings) we construct certain contractions, called "homotopes". The construction is geometric, using as ingredient involutions of associative…

Rings and Algebras · Mathematics 2010-05-19 Wolfgang Bertram , Michael Kinyon

For all classical groups (and for their analogs in infinite dimension or over general base fields or rings) we construct certain contractions, called "homotopes". The construction is geometric, using as ingredient involutions of associative…

Rings and Algebras · Mathematics 2010-05-31 Wolfgang Bertram , Michael Kinyon

This article supports the epistemological claim that sound human reasoning about ultimate knowledge is either foundational or circularly justified. In particular, questions which naturally arise in theology, philosophy, and related…

History and Overview · Mathematics 2025-08-29 Chad R. Mangum

We survey Lawvere theories at the level of infinity categories, as an alternative framework for higher algebra (rather than infinity operads). From a pedagogical perspective, they make many key definitions and constructions less technical.…

Category Theory · Mathematics 2019-03-12 John D. Berman

The Univalent Foundations requires a logic that allows us to define structures on homotopy types, similar to how first-order logic with equality ($\text{FOL}_=$) allows us to define structures on sets. We develop the syntax, semantics and…

Logic · Mathematics 2017-09-27 Dimitris Tsementzis

One of the prime motivation for topology was Homotopy theory, which captures the general idea of a continuous transformation between two entities, which may be spaces or maps. In later decades, an algebraic formulation of topology was…

Category Theory · Mathematics 2025-11-24 Suddhasattwa Das

One often sees a sharp distinction in mathematics between descriptions from the outside and from the inside. Think of defining a set in the plane through an algebraic equation, or dynamically as the closure of the orbit of some point under…

Logic · Mathematics 2016-09-06 Alessandra Carbone , S. Semmes

We show the functional completeness for the connectives of the non-trivial negation inconsistent logic C by using a well-established method implementing purely proof-theoretic notions only. Firstly, given that C contains a strong negation,…

Logic in Computer Science · Computer Science 2025-07-10 Sara Ayhan , Hrafn Valtýr Oddsson

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…

Logic in Computer Science · Computer Science 2022-05-25 Luca Geatti , Alessandro Gianola , Nicola Gigante

This paper presents mathematics as a general science of computation in a way different from the tradition. It is based on the radical philosophical standpoint according to which the content, meaning and justification of experience lies in…

History and Overview · Mathematics 2007-05-23 Aarno Hohti

As already mentioned by Lawvere in his 1973 paper, the characterisation of Cauchy completeness of metric spaces in terms of representability of adjoint distributors amounts to the idempotent-split property of an ordinary category when the…

Category Theory · Mathematics 2025-10-02 Dirk Hofmann , Walter Tholen

We use a category-theoretic formulation of Aczel's Fullness Axiom from Constructive Set Theory to derive the local cartesian closure of an exact completion. As an application, we prove that such a formulation is valid in the homotopy…

Category Theory · Mathematics 2020-12-18 Jacopo Emmenegger

Various topological concepts are often involved in the research of mathematical logic, and almost all of these concepts can be regarded as developing from the Stone representation theorem. In the Stone representation theorem, a Boolean…

Logic · Mathematics 2022-10-18 Yunfei Qin

We explore inflectional morphology as an example of the relationship of the discrete and the continuous in linguistics. The grammar requests a form of a lexeme by specifying a set of feature values, which corresponds to a corner M of a…

Computation and Language · Computer Science 2017-03-14 John Goldsmith , Eric Rosen
‹ Prev 1 8 9 10 Next ›