English
Related papers

Related papers: Ultraproducts in abstract categorical logic

200 papers

In this paper we provide a unifying description of different types of semantics of modal logic found in the literature via the framework of topological categories. In the style of categorical logic, we establish an exact correspondence…

Category Theory · Mathematics 2023-08-01 Lingyuan Ye

Locales have been studied as "topologies without points", mainly by tools of category theory. While traditional topology presents a space as a set of points with specified neighborhoods, localic topology presents a space as a lattice of…

Category Theory · Mathematics 2023-11-20 Dusko Pavlovic

After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…

Logic in Computer Science · Computer Science 2018-04-23 Francesco Dagnino

We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new…

Logic · Mathematics 2020-08-19 Eveline Lehmann , Thomas Studer

Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…

Category Theory · Mathematics 2019-11-28 Soichiro Fujii

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

The notion of a generalized product, refining that of a (symmetric and smooth) simplicial space is introduced and shown to imply the existence of an algebra of pseudodifferential operators. This encompasses many constructions of such…

Differential Geometry · Mathematics 2024-12-19 Richard B. Melrose

Non-Archimedean mathematics (in particular, nonstandard analysis) allows to construct some useful models to study certain phenomena arising in PDE's; for example, it allows to construct generalized solutions of differential equations and…

Logic · Mathematics 2015-12-18 Vieri Benci , Lorenzo Luperi Baglini

This work builds upon a well-established research tradition on modal logics of awareness. One of its aims is to export tools and techniques to other areas within modal logic. To this end, we illustrate a number of significant bridges with…

Logic in Computer Science · Computer Science 2023-07-12 Carlo Proietti , Fernando R. Velázquez-Quesada , Antonio Yuste-Ginel

Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully benefit from this theory, we believe that it can be enriched…

Logic in Computer Science · Computer Science 2012-01-23 Pascal Hitzler , Markus Krötzsch , Guo-Qiang Zhang

We propose a mathematical framework for a unification of the distributional theory of meaning in terms of vector space models, and a compositional theory for grammatical types, for which we rely on the algebra of Pregroups, introduced by…

Computation and Language · Computer Science 2010-03-24 Bob Coecke , Mehrnoosh Sadrzadeh , Stephen Clark

$L$-functions can be viewed axiomatically, such as in the formulation due to Selberg, or they can be seen as arising from cuspidal automorphic representations of $\textrm{GL}(n)$, as first described by Langlands. Conjecturally these two…

Number Theory · Mathematics 2017-11-29 David W. Farmer , Ameya Pitale , Nathan C. Ryan , Ralf Schmidt

An approach to universal (meta-)logical reasoning in classical higher-order logic is employed to explore and study simplifications of Kurt G\"odel's modal ontological argument. Some argument premises are modified, others are dropped, modal…

Logic in Computer Science · Computer Science 2020-06-16 Christoph Benzmüller

Conceptual reasoning, the ability to reason in abstract and high-level perspectives, is key to generalization in human cognition. However, limited study has been done on large language models' capability to perform conceptual reasoning. In…

Computation and Language · Computer Science 2024-04-02 Ben Zhou , Hongming Zhang , Sihao Chen , Dian Yu , Hongwei Wang , Baolin Peng , Dan Roth , Dong Yu

We present the foundational theory of condensed sets and basic condensed algebra after having introduced key concepts from category theory and homological algebra. In the later sections, we indicate the relevance of condensed mathematics to…

Category Theory · Mathematics 2025-04-01 Noa Bihlmaier , Nick Ruoff , Philipp Schmale

Canonical extension has proven to be a powerful tool in algebraic study of propositional logics. In this paper we describe a generalization of the theory of canonical extension to the setting of first order logic. We define a notion of…

Category Theory · Mathematics 2012-07-05 Dion Coumans

The pursuit of interpretable artificial intelligence has led to significant advancements in the development of methods that aim to explain the decision-making processes of complex models, such as deep learning systems. Among these methods,…

Machine Learning · Computer Science 2024-10-29 Yihao Zhang

We develop a model of abduction in abstract argumentation, where changes to an argumentation framework act as hypotheses to explain the support of an observation. We present dialogical proof theories for the main decision problems (i.e.,…

Artificial Intelligence · Computer Science 2014-07-16 Richard Booth , Dov Gabbay , Souhila Kaci , Tjitze Rienstra , Leendert van der Torre

An approach for encoding abstract dialectical frameworks and their semantics into classical higher-order logic is presented. Important properties and semantic relationships are formally encoded and proven using the proof assistant…

Logic in Computer Science · Computer Science 2026-04-08 Antoine Martina , Alexander Steen

Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite product theories) or using monads, and the category of Lawvere theories is equivalent to the category of finitary monads on Set. We show how…

Category Theory · Mathematics 2011-04-14 Stephen Lack , Jiri Rosicky