English
Related papers

Related papers: First-order homotopical logic

200 papers

We investigate algebraic and compositional properties of abstract multiway rewriting systems, which are archetypical structures underlying the formalism of the Wolfram model. We demonstrate the existence of higher homotopies in this class…

Category Theory · Mathematics 2021-11-29 Xerxes D. Arsiwalla , Jonathan Gorard , Hatem Elshatlawy

We present a simple resolution proof system for higher-order constrained Horn clauses (HoCHC) - a system of higher-order logic modulo theories - and prove its soundness and refutational completeness w.r.t. the standard semantics. As…

Logic in Computer Science · Computer Science 2021-06-22 C. -H. Luke Ong , Dominik Wagner

This paper studies the homotopy theory of algebras and homotopy algebras over an operad. It provides an exhaustive description of their higher homotopical properties using the more general notion of morphisms called infinity-morphisms. The…

Algebraic Topology · Mathematics 2016-02-09 Bruno Vallette

Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…

Logic in Computer Science · Computer Science 2026-05-14 Neta Elad , Sharon Shoham

There is a well-established homotopy theory of simplicial objects in a Grothendieck topos, and folklore says that the weak equivalences are axiomatisable in the geometric fragment of $L_{\omega_1, \omega}$. We show that it is in fact a…

Category Theory · Mathematics 2014-05-01 Zhen Lin Low

The goal of the present paper is to compare, in a precise way, two notions of operads up to homotopy which appear in the literature. Namely, we construct a functor from the category of strict unital homotopy colored operads to the category…

Algebraic Topology · Mathematics 2015-06-16 Brice Le Grignou

Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and…

Logic · Mathematics 2025-02-12 H. Andréka , J. Madarász , I. Németi , G. Székely

Although contemporary model theory has been called "algebraic geometry minus fields", the formal methods of the two fields are radically different. This dissertation aims to shrink that gap by presenting a theory of logical schemes,…

Logic · Mathematics 2014-02-12 Spencer Breiner

G\"odel's Dialectica interpretation was designed to obtain a relative consistency proof for Heyting arithmetic, to be used in conjunction with the double negation interpretation to obtain the consistency of Peano arithmetic. In recent…

Category Theory · Mathematics 2021-09-17 Davide Trotta , Matteo Spadetto , Valeria de Paiva

We present a natural standard translation of inquisitive modal logic InqML into first-order logic over the natural two-sorted relational representations of the intended models, which captures the built-in higher-order features of InqML.…

Logic · Mathematics 2021-04-15 Silke Meißner , Martin Otto

We examine the variational and conformal structures of higher order theories of gravity which are derived from a metric-connection Lagrangian that is an arbitrary function of the curvature invariants. We show that the constrained first…

General Relativity and Quantum Cosmology · Physics 2009-10-30 S. Cotsakis , J. Miritzis , L. Querella

The lifting problem for continuous bi-equivariant maps and bi-equivariant covering homotopies is considered, which leads to the notion of a bi-equivariant fibration. An intrinsic characteristic of a bi-equivariant Hurewicz fibration is…

General Topology · Mathematics 2023-07-24 Pavel S. Gevorgyan

Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…

Logic in Computer Science · Computer Science 2016-06-22 Michael Elberfeld , Marlin Frickenschmidt , Martin Grohe

We show that isomorphisms of fundamental groups of elementary anabelian varieties -- varieties obtained as iterated fibrations of hyperbolic curves -- over sub-$p$-adic fields correspond bijectively to isomorphisms of varieties. Moreover,…

Number Theory · Mathematics 2026-04-29 Magnus Carlson

We investigate the logical foundations of hyperproperties. Hyperproperties generalize trace properties, which are sets of traces, to sets of sets of traces. The most prominent application of hyperproperties is information flow security:…

Logic in Computer Science · Computer Science 2017-01-10 Bernd Finkbeiner , Martin Zimmermann

In this thesis, we present a flexible framework for specifying and constructing operads which are suited to reasoning about network construction. The data used to present these operads is called a \emph{network model}, a monoidal variant of…

Category Theory · Mathematics 2021-01-20 Joe Moeller

We prove preservation theorems for $\mathcal{L}_{\omega_1, G}$, the countable fragment of Vaught's closed game logic. These are direct generalizations of the theorems of \L{}o\'s-Tarski (resp. Lyndon) on sentences of $\mathcal{L}_{\omega_1,…

Logic · Mathematics 2019-12-30 Christian Espíndola

We look at homotopy-coherent diagrams of spaces (after Segal, Leitch, Vogt, Mather, Cordier) over a Grothendieck site; we call these ``flexible presheaves''. After some preliminary materiel, we define the ``flexible sheaf'' condition. This…

q-alg · Mathematics 2008-02-03 Carlos Simpson

Over a monoidal model category, under some mild assumptions, we equip the categories of colored PROPs and their algebras with projective model category structures. A Boardman-Vogt style homotopy invariance result about algebras over…

Algebraic Topology · Mathematics 2009-09-25 Mark W. Johnson , Donald Yau

We show that a partial-correctness assertion about an iterative program is provable in Hoare Logic iffit is provable in standard second-order logic with comprehension restricted to first-order predicates. This equivalence was claimed twice…

Logic in Computer Science · Computer Science 2026-05-15 Daniel Leivant