English
Related papers

Related papers: ST and TS as Product and Sum

200 papers

The typical mathematical language systematically exploits notational and logical abuses whose resolution requires not just the knowledge of domain specific notation and conventions, but not trivial skills in the given mathematical…

Logic in Computer Science · Computer Science 2011-03-18 Andrea Asperti , Enrico Tassi

The notion of a partition on a set is mathematically dual to the notion of a subset of a set, so there is a logic of partitions dual to Boole's logic of subsets (Boolean subset logic is usually mis-specified as the special case of…

Quantum Physics · Physics 2018-03-06 David Ellerman

Given two relations containing multiple measurements - possibly with uncertainties - our objective is to find which sets of attributes from the first have a corresponding set on the second, using exclusively a sample of the data. This…

Databases · Computer Science 2022-07-20 Alejandro Alvarez-Ayllon , Manuel Palomo-Duarte , Juan-Manuel Dodero

Proof-theoretic semantics (P-tS) is the approach to meaning in logic based on 'proof' (as opposed to 'truth'). There are two major approaches to P-tS: proof-theoretic validity (P-tV) and base-extension semantics (B-eS). The former is a…

Logic in Computer Science · Computer Science 2024-09-13 Alexander V. Gheorghiu , David J. Pym

We show that there exist infinitely many pairs of non-homeomorphic closed oriented SOL torus bundles with the same quantum (TQFT) invariants. This follows from the arithmetic behind the conjugacy problem in $SL(2,\Z)$ and its congruence…

Geometric Topology · Mathematics 2014-11-11 Louis Funar

We present the architecture and the evaluation of a new system for recognizing textual entailment (RTE). In RTE we want to identify automatically the type of a logical relation between two input texts. In particular, we are interested in…

Computation and Language · Computer Science 2013-10-21 Andreas Wotzlaw , Ravi Coote

Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties. The specificity of cost functions is…

Logic in Computer Science · Computer Science 2017-02-09 Denis Kuperberg

The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed…

Logic in Computer Science · Computer Science 2016-02-29 Luigi Santocanale

Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions…

Logic in Computer Science · Computer Science 2020-02-19 Amelia Harrison , Vladimir Lifschitz , Miroslaw Truszczynski

Theoretical equivalence and duality are two closely related notions: but their interconnection has so far not been well understood. In this paper I explicate the contribution of a recent schema for duality to discussions of theoretical…

History and Philosophy of Physics · Physics 2019-06-27 Sebastian De Haro

We introduce and study a notion of duality for two classes of optimization problems commonly occurring in probability theory. That is, on an abstract measurable space $(\Omega,\mathcal{F})$, we consider pairs $(E,\mathcal{G})$ where $E$ is…

Probability · Mathematics 2025-07-03 Adam Quinn Jaffe

This thesis deals with General Probabilistic Theories (GPTs) and Entanglement Structures (ESs). An ES is a possible structure of a quantum composite system in GPTs, which is not uniquely determined as the Standard Entanglement Structure…

Quantum Physics · Physics 2023-02-27 Hayato Arai

Profinite algebras are the residually finite compact algebras; their underlying topological spaces are Stone spaces. We extend the theory of profinite algebras to a more general setting of Stone topological algebras. We introduce Stone…

Logic · Mathematics 2024-09-25 Jorge Almeida , Ondřej Klíma

By considering a (not necessarily locally-flat) PL knot as the singular locus of a PL stratified pseudomanifold, we can use intersection homology theory to define intersection Alexander polynomials, a generalization of the classical…

Geometric Topology · Mathematics 2011-03-31 Greg Friedman

We introduce and study the Scott adjunction, relating accessible categories with directed colimits to topoi. Our focus is twofold, we study both its applications to formal model theory and its geometric interpretation. From the geometric…

Category Theory · Mathematics 2020-09-17 Ivan Di Liberti

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

Group Theory · Mathematics 2014-11-25 Jorge Almeida , Stuart Margolis , Benjamin Steinberg , Mikhail Volkov

Intuitive Set Theory (IST) is defined as the theory we get, when we add Axiom of Monotonicity and Axiom of Fusion to Zermelo-Fraenkel set theory. In IST, Continuum Hypothesis is a theorem, Axiom of Choice is a theorem, Skolem paradox does…

General Mathematics · Mathematics 2007-05-23 Kannan Nambiar

The traditional analysis of the basic version of the double-slit experiment leads to the conclusion that wave-particle duality is a fundamental fact of nature. However, such a conclusion means to imply that we are not only required to have…

Quantum Physics · Physics 2021-07-09 Arkady Bolotin

We investigate a version of linear temporal logic whose propositional fragment is G\"odel-Dummett logic (which is well known both as a superintuitionistic logic and a t-norm fuzzy logic). We define the logic using two natural semantics:…

Logic in Computer Science · Computer Science 2023-06-29 Juan Pablo Aguilera , Martín Diéguez , David Fernández-Duque , Brett McLean

Filinski constructed a symmetric lambda-calculus consisting of expressions and continuations which are symmetric, and functions which have duality. In his calculus, functions can be encoded to expressions and continuations using primitive…

Logic in Computer Science · Computer Science 2021-02-01 Tatsuya Abe , Daisuke Kimura