Related papers: Intersection Types and Lambda Theories
A simple lattice model inducing a gauge theory is considered. The model describes an interaction of a gauge field to an $N\times N$ complex matrix scalar field transforming as a field in the fundamental representation. In contrast to the…
We generalize several recognizability theorems for free single-sorted algebras to the field of many-sorted algebras and provide, in a uniform way and without using neither regular tree grammars nor tree automata, purely algebraic proofs of…
The thermodynamics of the lattice model of intercalation of ions in crystals is considered in the mean field approximation. Pseudospin formalism is used for the description of interaction of electrons with ions and the possibility of…
We propose a new formulation of lattice theory. It is given by a matrix form and suitable for satisfying Leibniz rule on lattice. The theory may be interpreted as a multi-flavor system. By realizing the difference operator as a commutator,…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
The validation of a theory is commonly based on appealing to clearly distinguishable and describable features in properly reduced experimental data, while the use of ab-initio simulation for interpreting experimental data typically requires…
One of the aims of Implicit Computational Complexity is the design of programming languages with bounded computational complexity; indeed, guaranteeing and certifying a limited resources usage is of central importance for various aspects of…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
Lattice perturbation theory is discussed in the overlap formulation for the Yukawa and gauge interactions. One and two point functions are studied for fermion, scalar and gauge fields, taking the Standard Model as an example. The formulae…
This paper introduces a formal notion of fixed point explanations, inspired by the "why regress" principle, to assess, through recursive applications, the stability of the interplay between a model and its explainer. Fixed point…
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…
I give an elementary introduction to the study of gauge theories coupled to fermions with many degrees of freedom. Besides their intrinsic interest, these theories are candidates for nonperturbative extensions of the Higgs sector of the…
In this essay, I present the advantages and, I dare say, the beauty of programming in a language with set-theoretic types, that is, types that include union, intersection, and negation type connectives. I show by several examples how…
The ability to understand and solve high-dimensional inference problems is essential for modern data science. This article examines high-dimensional inference problems through the lens of information theory and focuses on the standard…
We present the first steps of interaction spaces theory, a universal mathematical theory of complex systems which is able to embed cellular automata, agent based models, master equation based models, stochastic or deterministic, continuous…
We study polymorphic type assignment systems for untyped lambda-calculi with effects, based on Moggi's monadic approach. Moving from the abstract definition of monads, we introduce a version of the call-by-value computational…
We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground lambda-term corresponds to some property of…
We study the question of extending the BCD intersection type system with additional type constructors. On the typing side, we focus on adding the usual rules for product types. On the subtyping side, we consider a generic way of defining a…
We give a new approach to intersection theory. Our "cycles" are closed manifolds mapping into compact manifolds and our "intersections" are elements of a homotopy group of a certain Thom space. The results are then applied in various…
It is well-known that intersection type assignment systems can be used to characterize strong normalization (SN). Typical proofs that typable lambda-terms are SN in these systems rely on semantical techniques. In this work, we study…