English
Related papers

Related papers: Fibered Universal Algebra for First-Order Logics

200 papers

G\"odel modal logics can be seen as extenions of intutionistic modal logics with the prelinearity axiom. In this paper we focus on the algebraic and relational semantics for G\"odel modal logics that leverages on the duality between finite…

Logic · Mathematics 2021-12-07 Tommaso Flaminio , Lluis Godo , Paula Menchón , Ricardo O. Rodriguez

We consider weighted structures, which extend ordinary relational structures by assigning weights, i.e. elements from a particular group or ring, to tuples present in the structure. We introduce an extension of first-order logic that allows…

Logic in Computer Science · Computer Science 2020-09-23 Steffen van Bergerem , Nicole Schweikardt

A natural extension of the Hopf-cyclic cohomology, with coefficients, is introduced to encompass topological Hopf algebras. The topological theory allows to work with infinite dimensional Lie algebras. Furthermore, the category of…

K-Theory and Homology · Mathematics 2018-07-30 Bahram Rangipour , Serkan Sütlü

Conditional logics play an important role in recent attempts to formulate theories of default reasoning. This paper investigates first-order conditional logic. We show that, as for first-order probabilistic logic, it is important not to…

Artificial Intelligence · Computer Science 2009-09-25 Nir Friedman , Joseph Y. Halpern , Daphne Koller

A classical result of topos theory holds that the category of coalgebras for a Cartesian comonad on a topos is again a topos (Kock and Wraith, 1971). It is natural to refine this result to a topos-theoretic setting that includes universes.…

Category Theory · Mathematics 2024-05-02 Colin Zwanziger

We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…

Logic · Mathematics 2021-01-01 Dakota Thor Ihli

Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…

Artificial Intelligence · Computer Science 2013-02-28 Bernhard Hollunder

The one-variable fragment of a first-order logic may be viewed as an "S5-like" modal logic, where the universal and existential quantifiers are replaced by box and diamond modalities, respectively. Axiomatizations of these modal logics have…

Logic · Mathematics 2024-11-20 Petr Cintula , George Metcalfe , Naomi Tokuda

We show that Martin Hyland's effective topos can be exhibited as the homotopy category of a path category $\mathbb{EFF}$. Path categories are categories of fibrant objects in the sense of Brown satisfying two additional properties and as…

Category Theory · Mathematics 2018-08-02 Benno van den Berg

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

Logic in Computer Science · Computer Science 2025-05-01 Nikolaos Galatos , Vitor Greati , Revantha Ramanayake , Gavin St. John

We develop a categorical framework for reasoning about abstract properties of differentiation, based on the theory of fibrations. Our work encompasses the first-order fragments of several existing categorical structures for differentiation,…

Category Theory · Mathematics 2024-09-10 Matteo Capucci , Geoffrey S. H. Cruttwell , Neil Ghani , Fabio Zanasi

We establish a novel connection between two research areas in non-classical logics which have been developed independently of each other so far: on the one hand, input/output logic, introduced within a research program developing logical…

We present generalized algebraic theories corresponding to slightly modified versions of two of the type theories in our paper Type Theory with Explicit Universe Polymorphism. We first present a generalized algebraic theory for categories…

Logic in Computer Science · Computer Science 2026-03-05 Marc Bezem , Thierry Coquand , Peter Dybjer , Martín Escardó

We introduce the basic elements of the theory of parametrized $\infty$-categories and functors between them. These notions are defined as suitable fibrations of $\infty$-categories and functors between them. We give as many examples as we…

Algebraic Topology · Mathematics 2016-08-15 Clark Barwick , Emanuele Dotto , Saul Glasman , Denis Nardin , Jay Shah

Regular and higher regular graded algebras (in simplest case satisfying Von Neumann regularity $\Theta_{1}\Theta_{2}\Theta_{1}=\Theta_{1}$ instead of anticommutativity) are introduced and their properties are studied. They are described in…

Quantum Algebra · Mathematics 2007-05-23 Steven Duplij , Wladyslaw Marcinek

We develop geometric approach to A-infinity algebras and A-infinity categories based on the notion of formal scheme in the category of graded vector spaces. Geometric approach clarifies several questions, e.g. the notion of homological unit…

Rings and Algebras · Mathematics 2024-07-16 Maxim Kontsevich , Yan Soibelman

This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…

Logic in Computer Science · Computer Science 2019-02-05 Stefan Milius , Henning Urbat

We attach to any linear endomorphism f of any vector space V a structure of prelie algebra on the shuffle algebra T(V); we describe its enveloping algebra, the dual Hopf algebra and the associated group of characters. For f=Id\_V, we find…

Rings and Algebras · Mathematics 2014-12-24 Loïc Foissy

The study of Description Logics have been historically mostly focused on features that can be translated to decidable fragments of first-order logic. In this paper, we leave this restriction behind and look for useful and decidable…

Logic in Computer Science · Computer Science 2023-08-30 Joshua Hirschbrunn , Yevgeny Kazakov

Logics closed under classes of substitutions broader than class of uniform substitutions are known as hyperformal logics. This paper extends known results about hyperformal logics in two ways. First: we examine a very powerful form of…

Logic · Mathematics 2026-04-28 Shay Allen Logan , Blane Worley
‹ Prev 1 4 5 6 7 8 10 Next ›