English
Related papers

Related papers: Coherence for Modalities

200 papers

We present a rooted hypersequent calculus for modal propositional logic S5. We show that all rules of this calculus are invertible and that the rules of weakening, contraction, and cut are admissible. Soundness and completeness are…

Logic · Mathematics 2019-05-23 Mojtaba Aghaei , Hamzeh Mohammadi

Many authors have investigated the congruence relations amongst the coefficients of power series expansions of modular forms $f$ in modular functions $t$. In a recent paper, R. Osburn and B. Sahu examine several power series expansions and…

Number Theory · Mathematics 2013-10-09 Richard Moy

We prove a coherence theorem for braided monoidal bicategories and relate it to the coherence theorem for monoidal bicategories. We show how coherence for these structures can be interpretted topologically using up-to-homotopy operad…

Category Theory · Mathematics 2011-02-07 Nick Gurski

A new scheme for proving pseudoidentities from a given set {\Sigma} of pseudoidentities, which is clearly sound, is also shown to be complete in many instances, such as when {\Sigma} defines a locally finite variety, a pseudovariety of…

Group Theory · Mathematics 2019-03-18 Jorge Almeida , Ondřej Klíma

Testing whether a probability distribution is compatible with a given Bayesian network is a fundamental task in the field of causal inference, where Bayesian networks model causal relations. Here we consider the class of causal structures…

Machine Learning · Statistics 2020-09-04 Aditya Kela , Kai von Prillwitz , Johan Aberg , Rafael Chaves , David Gross

We introduce the dual notions of $\mathcal{E}(\mathcal{X},M,\mathcal{Y})$ and $\mathcal{M}(\mathcal{X},M,\mathcal{Y})$, and investigate when they have enough injective objects or projective objects, when they are resolving or co-resolving,…

Commutative Algebra · Mathematics 2021-12-21 Dancheng Lu , Panpan Xie

Theories featuring the interaction between a Frobenius algebra and a Hopf algebra have recently appeared in several areas in computer science: concurrent programming, control theory, and quantum computing, among others. Bonchi, Sobocinski,…

Logic in Computer Science · Computer Science 2016-01-20 Ross Duncan , Kevin Dunne

Given a finite collection of probability measures defined on subsets of a measurable space, how can we determine if they are compatible, in the sense that they can be realized as conditional distributions of a single probability measure on…

Probability · Mathematics 2025-12-11 Owen D. Biesel , Colin McSwiggen , Ted Theodosopoulos , Michael G. Titelbaum

It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…

Logic · Mathematics 2013-07-25 Kevin Davila Castellar , Ismael Gutierrez Garcia

In this work we study a kind of coherence condition on FI_G-modules, which generalizes the usual notion of finite generation. We prove that a module is coherent, in the appropriate sense, if and only if its generators, as well as its…

K-Theory and Homology · Mathematics 2016-06-15 Eric Ramos

The theme of the paper is the use of commutative Frobenius algebras in braided strict monoidal categories in the study of varieties of circuits and communicating systems which occur in Computer Science, including circuits in which the wires…

Category Theory · Mathematics 2011-10-05 R. Rosebrugh , N. Sabadini , R. F. C. Walters

To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…

Group Theory · Mathematics 2018-04-24 Akram Yousofzadeh

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

The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…

Logic · Mathematics 2012-07-26 Joel David Hamkins , George Leibman , Benedikt Löwe

Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent computations where code usage plays a central role. The theory of program equivalence for modal and coeffectful languages, however, is…

Logic in Computer Science · Computer Science 2021-03-08 Ugo Dal Lago , Francesco Gavazzo

We propose a general framework to allow: (a) specifying the operational semantics of a programming language; and (b) stating and proving properties about program correctness. Our framework is based on a many-sorted system of hybrid modal…

Logic in Computer Science · Computer Science 2025-12-01 Ioana Leustean , Natalia Moanga , Traian Florin Serbanuta

The study of theory combination in Satisfiability Modulo Theories (SMT) involves various model theoretic properties (e.g., stable infiniteness, smoothness, etc.). We show that such properties can be partly captured by the natural density of…

Logic in Computer Science · Computer Science 2025-05-23 Guilherme V. Toledo , Yoni Zohar

We prove several Ramanujan-type congruences modulo powers of $5$ for partition $k$-tuples with $5$-cores, for $k=2, 3, 4$. We also prove some new infinite families of congruences modulo powers of primes for $k$-tuples with $p$-cores, where…

Number Theory · Mathematics 2023-02-06 Manjil P. Saikia , Abhishek Sarma , Pranjal Talukdar

We present distributions of countable models and correspondent structural characteristics of complete theories with continuum many types: for prime models over finite sets relative to Rudin-Keisler preorders, for limit models over types and…

Logic · Mathematics 2012-10-16 Roman A. Popkov , Sergey V. Sudoplatov

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…

Number Theory · Mathematics 2020-06-09 Maxwell Schneider , Robert Schneider
‹ Prev 1 8 9 10 Next ›