English
Related papers

Related papers: Logic on the n-cube

200 papers

We introduce a two-dimensional metric (interval) temporal logic whose internal and external time flows are dense linear orderings. We provide a suitable semantics and a sequent calculus with axioms for equality and extralogical axioms. Then…

Logic · Mathematics 2019-03-15 Stefano Baratella , Andrea Masini

We determine the algebraic and transcendental lattices of a general cubic fourfold with a symplectic automorphism of prime order. We prove that cubic fourfolds admitting a symplectic automorphism of order at least three are rational, and we…

Algebraic Geometry · Mathematics 2025-12-11 Simone Billi , Annalisa Grossi , Lisa Marquand

Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…

Logic in Computer Science · Computer Science 2025-03-12 Vitor Greati , Sérgio Marcelino , João Marcos , Umberto Rivieccio

In this paper consisting of two parts, we study the integral of a logarithmic differential form on a compact semi-algebraic set in R^n or C^n. In Part I, we prove the convergence of the integral when the semi-algebraic set satisfies…

Algebraic Geometry · Mathematics 2015-09-24 Masaki Hanamura , Kenichiro Kimura , Tomohide Terasoma

Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…

Logic · Mathematics 2023-03-07 Mariana Floricica Calin , Cristina Flaut , Dana Piciu

This paper concerns an expansion of first-order Belnap-Dunn logic whose connectives and quantifiers all have a counterpart in classical logic. The language and logical consequence relation of this paradefinite logic are defined, a sequent…

Logic in Computer Science · Computer Science 2026-03-04 C. A. Middelburg

The operad of moulds is realized in terms of an operational calculus of formal integrals (continuous formal power series). This leads to many simplifications and to the discovery of various suboperads. In particular, we prove a conjecture…

Quantum Algebra · Mathematics 2007-10-18 Frédéric Chapoton , Florent Hivert , Jean-Christophe Novelli , Jean-Yves Thibon

This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…

Logic in Computer Science · Computer Science 2022-02-18 Lawrence S. Moss , Thomas F. Icard

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…

Logic · Mathematics 2024-06-25 Wesley H. Holliday

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

We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…

Logic in Computer Science · Computer Science 2026-05-13 Sebastian Enqvist

The present paper constructs three new systems of clarithmetic (arithmetic based on computability logic --- see http://www.cis.upenn.edu/~giorgi/cl.html): CLA8, CLA9 and CLA10. System CLA8 is shown to be sound and extensionally complete…

Logic in Computer Science · Computer Science 2012-11-21 Giorgi Japaridze

Non-normal modal logics, interpreted on neighbourhood models which generalise the usual relational semantics, have found application in several areas, such as epistemic, deontic, and coalitional reasoning. We present here preliminary…

Logic in Computer Science · Computer Science 2022-07-04 Tiziano Dalmonte , Andrea Mazzullo , Ana Ozaki

A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…

Logic · Mathematics 2021-07-13 T. Moraschini

We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

A classification of discrete integrable systems on quad-graphs, i.e. on surface cell decompositions with quadrilateral faces, is given. The notion of integrability laid in the basis of the classification is the three-dimensional…

Exactly Solvable and Integrable Systems · Physics 2009-11-07 V. E. Adler , A. I. Bobenko , Yu. B. Suris

We show that the techniques for resource control that have been developed in the so-called "light logics" can be fruitfully applied also to process algebras. In particular, we present a restriction of Higher-Order pi-calculus inspired by…

Logic in Computer Science · Computer Science 2019-02-20 Ugo Dal Lago , Simone Martini , Davide Sangiorgi

We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…

Combinatorics · Mathematics 2023-11-21 Michael J. Gottstein

In this paper we discuss a result similar to the polynomial version of the Alon-F\"uredi theorem. We prove that if you want to cover the vertices of the $n$-dimensional unit cube, except those of weight at most $r$ then you need an…

Combinatorics · Mathematics 2023-04-03 Peter Sziklai , Zsuzsa Weiner

We realize the enveloping algebra of the positive part of a semisimple complex Lie algebra as a convolution algebra of constructible functions on module varieties of some Iwanaga-Gorenstein algebras of dimension 1.

Representation Theory · Mathematics 2016-10-25 Christof Geiss , Bernard Leclerc , Jan Schröer