English
Related papers

Related papers: Predicate Liftings and Functor Presentations in Co…

200 papers

Nominal sets provide a framework to study key notions of syntax and semantics such as fresh names, variable binding and $\alpha$-equivalence on a conveniently abstract categorical level. Coalgebras for endofunctors on nominal sets model,…

Logic in Computer Science · Computer Science 2016-07-27 Stefan Milius , Lutz Schröder , Thorsten Wißmann

We prove modularity lifting theorems for l-adic Galois representations of any dimension satisfying a unitary type condition and a Fontaine-Laffaille type condition at l. This extends the results of Clozel, Harris and Taylor, and the…

Number Theory · Mathematics 2019-02-20 Lucio Guerberoff

A key ingredient in the Taylor-Wiles proof of Fermat last theorem is the classical Ihara's lemma which is used to rise the modularity property between some congruent galoisian representations. In their work on Sato-Tate,…

Number Theory · Mathematics 2022-11-14 Pascal Boyer

We introduce FiLex, a self-reinforcing stochastic process which models finite lexicons in emergent language experiments. The central property of FiLex is that it is a self-reinforcing process, parallel to the intuition that the more a word…

Computation and Language · Computer Science 2022-06-23 Brendon Boldt , David Mortensen

The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we discuss whether the hypothesis of the aforementioned result can be weakened. An…

Information Theory · Computer Science 2024-01-25 Asier Estevan , Juan-José Minãna , Oscar Valero

We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of…

Logic · Mathematics 2023-03-28 Antti Valmari , Lauri Hella

We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which…

Logic in Computer Science · Computer Science 2026-04-20 Gilles Dowek , Murdoch J. Gabbay

It is well known that classical varieties of $\Sigma$-algebras correspond bijectively to finitary monads on $\mathsf{Set}$. We present an analogous result for varieties of ordered $\Sigma$-algebras, i.e., classes presented by inequations…

Category Theory · Mathematics 2021-01-07 J. Adámek , M. Dostál , J. Velebil

Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…

Programming Languages · Computer Science 2015-02-05 Mauro Jaskelioff , Russell O'Connor

We aim at a holistic perspective on program logics, including Hoare and incorrectness logics. To this end, we study different classes of properties arising from the generalization of the aforementioned logics. We compare our results with…

Logic in Computer Science · Computer Science 2023-12-18 Lena Verscht , Benjamin Kaminski

We study the generalization abilities of language models when translating natural language into formal specifications with complex semantics. In particular, we fine-tune language models on three datasets consisting of English sentences and…

Software Engineering · Computer Science 2022-10-21 Christopher Hahn , Frederik Schmitt , Julia J. Tillman , Niklas Metzger , Julian Siber , Bernd Finkbeiner

We extend Barr's well-known characterization of the final coalgebra of a $Set$-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a $Set$-monad $\mathbf{M}$ for functors arising as liftings.…

Category Theory · Mathematics 2010-05-07 Adriana Balan , Alexander Kurz

Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…

Logic in Computer Science · Computer Science 2019-05-14 Lê Thành Dũng Nguyên

Many kinds of categorical structure require the existence of finite limits, of colimits of some specified type, and of "exactness" conditions between the finite limits and the specified colimits. Some examples are the notions of regular, or…

Category Theory · Mathematics 2012-02-20 Richard Garner , Stephen Lack

We study expressibility in infinitary languages of the modal operators associated with satisfiability of sentences of these languages in submodels and extensions of models. We give a syntactic criterion for expressibility in finitary…

Logic · Mathematics 2026-05-05 Nikolai L. Poliakov , Denis I. Saveliev

One of the common traits of past and present approaches for Semantic Role Labeling (SRL) is that they rely upon discrete labels drawn from a predefined linguistic inventory to classify predicate senses and their arguments. However, we argue…

Computation and Language · Computer Science 2022-12-05 Simone Conia , Edoardo Barba , Alessandro Scirè , Roberto Navigli

The integration of lexical semantics and pragmatics in the analysis of the meaning of natural lan- guage has prompted changes to the global framework derived from Montague. In those works, the original lexicon, in which words were assigned…

Computation and Language · Computer Science 2013-09-05 Bruno Mery , Christian Retoré

Behavioural distances measure the deviation between states in quantitative systems, such as probabilistic or weighted systems. There is growing interest in generic approaches to behavioural distances. In particular, coalgebraic methods…

Category Theory · Mathematics 2023-05-03 Sergey Goncharov , Dirk Hofmann , Pedro Nora , Lutz Schröder , Paul Wild

We prove new modularity lifting theorems for p-adic Galois representations in situations where the methods of Wiles and Taylor--Wiles do not apply. Previous generalizations of these methods have been restricted to situations where the…

Number Theory · Mathematics 2017-07-18 Frank Calegari , David Geraghty

In this paper, we prove a minimal modularity lifting theorem for Galois representations (conjecturally) associated to Siegel modular forms of genus two which are holomorphic limits of discrete series at infinity.

Number Theory · Mathematics 2020-12-16 Frank Calegari , David Geraghty