English
Related papers

Related papers: Generic substitutions

200 papers

The aim of this paper is to offer an algebraic definition of infinite determinants of finite potent endomorphisms using linear algebra techniques. It generalizes Grothendieck's determinant for finite rank endomorphisms and is equivalent to…

Rings and Algebras · Mathematics 2013-03-28 Daniel Hernández Serrano , Fernando Pablos Romo

One of the main claims of the paper is that Dirac's calculus and broader theories of physics can be treated as theories written in the language of Continuous Logic. Establishing its true interpretation (model) is a model theory problem. The…

Logic · Mathematics 2024-10-04 Boris Zilber

Multidimensional combinatorial substitutions are rules that replace symbols by finite patterns of symbols in $\mathbb Z^d$. We focus on the case where the patterns are not necessarily rectangular, which requires a specific description of…

Discrete Mathematics · Computer Science 2014-06-27 Timo Jolivet , Jarkko Kari

The configuration space of general relativity is superspace - the space of all Riemannian 3-metrics modulo diffeomorphisms. However, it has been argued that the configuration space for gravity should be conformal superspace - the space of…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Bryan Kelleher

The question whether an ontology can safely be replaced by another, possibly simpler, one is fundamental for many ontology engineering and maintenance tasks. It underpins, for example, ontology versioning, ontology modularization,…

Artificial Intelligence · Computer Science 2018-04-24 Elena Botoeva , Boris Konev , Carsten Lutz , Vladislav Ryzhikov , Frank Wolter , Michael Zakharyaschev

This paper proves that the equational theory of the class $RA_{\alpha}^{csp}$ of representable polyadic algebras is finitely axiomatizable over its substitution-free reduct $RA_{\alpha}^{cp}$, for finite $\alpha$. That is, substitutions of…

Logic · Mathematics 2025-06-17 Hajnal Andréka , Zalán Gyenis , István Németi

In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish…

Logic · Mathematics 2009-05-05 Karim Nour , Abir Nour

We study the notion of conservative translation between logics introduced by Feitosa and D'Ottaviano. We show that classical propositional logic (CPC) is universal in the sense that every finitary consequence relation over a countable set…

Logic · Mathematics 2012-11-29 Emil Jeřábek

Abductive forgetting is removing variables from a logical formula while maintaining its abductive explanations. It is carried in two alternative ways depending on its intended application. Both differ from the usual forgetting, which…

Logic in Computer Science · Computer Science 2025-07-22 Paolo Liberatore

The article demonstrates that logic is not necessarily singleton and does not always have the standard interpretation of negation. Appropriate generalizations of logic are suggested. Positive logic and multivalued negation operations are…

Logic · Mathematics 2024-01-30 Volodymyr M. Zhuravlov

The notion of non-deterministic logical matrix (where connectives are interpreted as multi-functions) preserves many good properties of traditional semantics based on logical matrices (where connectives are interpreted as functions) whilst…

Logic in Computer Science · Computer Science 2022-04-15 Pedro Filipe , Carlos Caleiro , Sérgio Marcelino

Some general properties of abstract relations are closely examined. These include generalizations of linearity, and properties based on `pinning' an inequality by a pair of families of endomorphisms.To each property we try to associate a…

Rings and Algebras · Mathematics 2007-05-23 James Hirschorn

Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary "propositional" logic should in general be the logic of subsets of a given universe set. Partitions on…

Logic · Mathematics 2009-12-30 David Ellerman

Analogy is a central faculty of human intelligence, enabling abstract patterns discovered in one domain to be applied to another. Despite its central role in cognition, the mechanisms by which Transformers acquire and implement analogical…

Artificial Intelligence · Computer Science 2026-05-28 Gouki Minegishi , Jingyuan Feng , Hiroki Furuta , Takeshi Kojima , Yusuke Iwasawa , Yutaka Matsuo

It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of non-orthomodular and thus non-distributive lattices that properly contain standard orthomodular and Boolean classes,…

Logic in Computer Science · Computer Science 2008-12-17 Mladen Pavicic , Norman D. Megill

This paper enlarges classical syllogistic logic with assertions having to do with comparisons between the sizes of sets. So it concerns a logical system whose sentences are of the following forms: {\sf All $x$ are $y$} and {\sf Some $x$ are…

Logic · Mathematics 2020-03-25 Lawrence S. Moss , Selçuk Topal

It is proved that every prevariety of algebras is categorically equivalent to a "prevariety of logic", i.e., to the equivalent algebraic semantics of some sentential deductive system. This allows us to show that no nontrivial equation in…

Logic · Mathematics 2019-02-13 T. Moraschini , J. G. Raftery

The canonical quantization of diffeomorphism invariant theories of connections in terms of loop variables is revisited. Such theories include general relativity described in terms of Ashtekar-Barbero variables and extension to Yang-Mills…

General Relativity and Quantum Cosmology · Physics 2015-06-25 Jose A. Zapata

We develop a unified categorical theory of substructural abstract syntax with variable binding and single-variable (capture-avoiding) substitution. This is done for the gamut of context structural rules given by exchange (linear theory)…

Logic in Computer Science · Computer Science 2025-06-02 Marcelo Fiore , Sanjiv Ranchod

Type-free systems of logic are designed to consistently handle significant instances of self-reference. Some consistent type-free systems also have the feature of allowing the sort of general abstraction or comprehension principle that…

Logic · Mathematics 2007-05-23 Wayne Aitken , Jeffrey A. Barrett