English
Related papers

Related papers: Twist-Valued Models for Three-valued Paraconsisten…

200 papers

We present a novel automata-based approach to address linear temporal logic modulo theory (LTL-MT) as a specification language for data words. LTL-MT extends LTL_f by replacing atomic propositions with quantifier-free multi-sorted…

Logic in Computer Science · Computer Science 2024-08-19 Marco Faella , Gennaro Parlato

Prompt engineering, particularly Chain-of-Thought (CoT) prompting, significantly enhances LLM reasoning capabilities. We introduce "Sculpting," a constrained, rule-based prompting method designed to improve upon standard CoT by reducing…

Computation and Language · Computer Science 2025-10-28 Imran Khan

We study two families of zeta-like multiple series -- the multiple $\rho$-values and the multiple $\eta$-values -- defined by nested sums with shifted denominators. An explicit factorial formula for $\rho$ reveals its intrinsic…

Number Theory · Mathematics 2025-11-06 Kwang-Wu Chen

In (Bezem 1999; Bezem 2001), M. Bezem defined an extensional semantics for positive higher-order logic programs. Recently, it was demonstrated in (Rondogiannis and Symeonidou 2016) that Bezem's technique can be extended to higher-order…

Programming Languages · Computer Science 2017-07-18 Panos Rondogiannis , Ioanna Symeonidou

We define and study twisted support varieties for modules over an Artin algebra, where the twist is induced by an automorphism of the algebra. Under a certain finite generation hypothesis, we show that the twisted variety of a module…

Rings and Algebras · Mathematics 2007-08-30 Petter Andreas Bergh

This work derives 5 methods to evaluate families of odd zeta values by combining a power of $\pi$ with Lambert series whose ratios of successive terms tend to $e^{-\pi\sqrt{a}}$ with integers $a\ge7$, outperforming Ramanujan's results with…

Number Theory · Mathematics 2024-04-04 David Broadhurst

We show how general principles of symmetry in quantum mechanics lead to twisted notions of a group representation. This framework generalizes both the classical 3-fold way of real/complex/quaternionic representations as well as a…

High Energy Physics - Theory · Physics 2015-06-11 Daniel S. Freed , Gregory W. Moore

We investigate mathematical structures that provide natural semantics for families of (quantified) non-classical logics featuring special unary connectives, known as recovery operators, that allow us to 'recover' the properties of classical…

Logic in Computer Science · Computer Science 2023-07-25 David Fuenmayor

The invariance thesis of Slot and van Emde Boas states that all reasonable models of computation simulate each other with polynomially bounded overhead in time and constant-factor overhead in space. In this paper we show that a family of…

Programming Languages · Computer Science 2021-02-12 Małgorzata Biernacka , Witold Charatonik , Tomasz Drab

Linear logic is a substructural logic proposed as a refinement of classical and intuitionistic logics, with applications in programming languages, game semantics, and quantum physics. We present a template for Gentzen-style linear logic…

Logic in Computer Science · Computer Science 2023-09-26 Alen Docef , Radu Negulescu , Mihai Prunescu

We show that in analogy to the introduction of Poisson structures twisted by a closed 3-form by Park and Klimcik-Strobl, the study of three dimensional sigma models with Wess-Zumino term leads in a likewise way to twisting of Courant…

High Energy Physics - Theory · Physics 2016-12-21 Markus Hansen , Thomas Strobl

In this note, we establish an analog of the Mallows-Sloane bound for Type III formal weight enumerators. This completes the bounds for all types (Types I through IV) in synthesis of our previous results. Next we show by using the binomial…

Number Theory · Mathematics 2017-09-12 Koji Chinen

A twisted generalized Weyl algebra A of degree n depends on a base algebra R, n commuting automorphisms s_i of R, n central elements t_i of R and on some additional scalar parameters. In a paper by V.Mazorchuk and L.Turowska (1999) it is…

Rings and Algebras · Mathematics 2020-06-09 Vyacheslav Futorny , Jonas T. Hartwig

The multiple zeta values are multivariate generalizations of the values of the Riemann zeta function at positive integers. The Bowman-Bradley theorem asserts that the multiple zeta values at the sequences obtained by inserting a fixed…

Number Theory · Mathematics 2014-06-11 Shingo Saito , Noriko Wakabayashi

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Logic · Mathematics 2025-07-03 Saharon Shelah

We consider a family of two-valued "fully evaluated left-sequential logics" (FELs), of which Free FEL (defined by Staudt in 2012) is most distinguishing (weakest) and immune to atomic side effects. Next is Memorising FEL, in which…

Logic in Computer Science · Computer Science 2026-05-14 Alban Ponse , Daan J. C. Staudt

Three dimensional gauge theories with a discrete gauge group can emerge from spin models as a gapped topological phase with fractional point excitations (gauge charge) and loop excitations (gauge flux). It is known that 3D gauge theories…

Strongly Correlated Electrons · Physics 2017-03-27 Zitao Wang , Xie Chen

We consider the integrability of a two-parameter deformation of the Wess-Zumino-Witten model, previously introduced in relation with Poisson-Lie T-duality. The resulting family of Poisson-Lie dual models is shown to be integrable by using…

High Energy Physics - Theory · Physics 2023-02-08 Francesco Bascone , Franco Pezzella , Patrizia Vitale

We investigate some well-known (and a few not-so-well-known) many-valued logics that have a small number (3 or 4) of truth values. For some of them we complain that they do not have any \emph{logical} use (despite their perhaps having some…

Artificial Intelligence · Computer Science 2017-11-17 Allen P. Hazen , Francis Jeffry Pelletier

Expressive querying of machine learning models - viewed as a form of intentional data - enables their verification and interpretation using declarative languages, thereby making learned representations of data more accessible. Motivated by…

Logic in Computer Science · Computer Science 2026-01-07 Martin Grohe , Christoph Standke , Juno Steegmans , Jan Van den Bussche