English
Related papers

Related papers: Affine logic with the integration operator

200 papers

In the first edition of Classification Theory, the second author characterized the stable theories in terms of saturation of ultrapowers. Prior to this theorem, stability had already been defined in terms of counting types, and the unstable…

Logic · Mathematics 2015-08-19 M. Malliaris , S. Shelah

Affine Lusztig varieties encode the orbital integrals of Iwahori--Hecke functions and serve as building blocks for the (conjectural) theory of affine character sheaves. We establish a close relationship between affine Lusztig varieties and…

Representation Theory · Mathematics 2024-10-10 Xuhua He

Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…

General Topology · Mathematics 2017-11-09 Boaz Tsaban

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

We introduce and develop a topological semantics of conservativity logics and interpretability logics. We prove the topological compactness theorem of consistent normal extensions of the conservativity logic $\mathbf{CL}$ by extending…

Logic · Mathematics 2021-09-14 Sohei Iwata , Taishi Kurahashi

We introduce a harmonic analysis for a class of affine iteration models in $\br^d$. Using Hilbert-space geometry, we develop a new duality notion for affine and contractive iterated function systems (IFSs) and we construct some identities…

Dynamical Systems · Mathematics 2008-08-14 Dorin E. Dutkay , Palle E. T. Jorgensen

This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic…

Logic in Computer Science · Computer Science 2021-08-02 Tim Lyon

We investigate the properties of Inclusion Logic, that is, First Order Logic with Team Semantics extended with inclusion dependencies. We prove that Inclusion Logic is equivalent to Greatest Fixed Point Logic, and we prove that all…

Logic in Computer Science · Computer Science 2013-05-01 Pietro Galliani , Lauri Hella

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…

Logic in Computer Science · Computer Science 2010-04-13 Kai Brünnler

We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…

Logic · Mathematics 2026-02-12 Tumadhir Alsulami , Marcel Jackson

We study fixpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We show that each lattice operator O has a unique most precise or…

Artificial Intelligence · Computer Science 2007-05-23 Marc Denecker , Victor W. Marek , Miroslaw Truszczynski

We develop the theory of mixed finite elements in terms of special inverse systems of complexes of differential forms, defined over cellular complexes. Inclusion of cells corresponds to pullback of forms. The theory covers for instance…

Numerical Analysis · Mathematics 2015-06-25 Snorre Harald Christiansen

We expand the notion of characteristic formula to infinite finitely presentable subdirectly irreducible algebras. We prove that there is a continuum of varieties of Heyting algebras containing infinite finitely presentable subdirectly…

Logic in Computer Science · Computer Science 2012-08-14 Alex Citkin

In this note we prove that every non characteristically filiform Lie algebra is endowed with an affine structure.

Rings and Algebras · Mathematics 2007-05-23 Elisabeth Remm

We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic…

Logic · Mathematics 2013-04-08 Tarek Sayed Ahmed

We give a general criterion for conformal embeddings of vertex operator algebras associated to affine Lie algebras at arbitrary levels. Using that criterion, we construct new conformal embeddings at admissible rational and negative integer…

Quantum Algebra · Mathematics 2011-05-31 Drazen Adamovic , Ozren Perse

We introduce the notion of amenability for affine algebras. We characterize amenability by Folner-sequences, paradoxicality and the existence of finitely invariant dimension-measures. Then we extend the results of Rowen on ranks, from…

Rings and Algebras · Mathematics 2007-05-23 Gabor Elek

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Kurz , Jiri Rosicky

Automorphisms of finite order and real forms of "smooth" affine Kac-Moody algebras are studied, i.e. of 2-dimensional extensions of the algebra of smooth loops in a simple Lie algebra. It is shown that they can be parametrized by certain…

Rings and Algebras · Mathematics 2009-04-01 Ernst Heintze , Christian Groß

We provide a general and syntactically-defined family of sequent calculi, called \emph{semi-analytic}, to formalize the informal notion of a "nice" sequent calculus. We show that any sufficiently strong (multimodal) substructural logic with…

Logic in Computer Science · Computer Science 2024-09-04 Amirhossein Akbar Tabatabai , Raheleh Jalali