English
Related papers

Related papers: Variable binding and substitution for (nameless) d…

200 papers

We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…

Logic · Mathematics 2013-02-14 Tarek Sayed Ahmed , Mohammad Assem

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

Logic in Computer Science · Computer Science 2023-06-22 Daniel Gratzer , G. A. Kavvos , Andreas Nuyts , Lars Birkedal

This paper proposes a way to compute the meanings associated with sentences with generic noun phrases corresponding to the generalized quantifier most. We call these generics specimens and they resemble stereotypes or prototypes in lexical…

Logic · Mathematics 2012-03-12 Christian Retoré

A new application of polytope theory to Lie theory is presented. Exponential sums of convex lattice polytopes are applied to the characters of irreducible representations of simple Lie algebras. The Brion formula is used to write a polytope…

Mathematical Physics · Physics 2007-05-23 M. A. Walton

Semantic word embeddings represent the meaning of a word via a vector, and are created by diverse methods. Many use nonlinear operations on co-occurrence statistics, and have hand-tuned hyperparameters and reweighting methods. This paper…

Machine Learning · Computer Science 2019-06-21 Sanjeev Arora , Yuanzhi Li , Yingyu Liang , Tengyu Ma , Andrej Risteski

The idea of this approach towards proving the consistency of Quine's New Foundations set theory is to go in a completely untyped manner. So no contemplation about types is utilized here. All conceptualization pivots around proving a handful…

Logic · Mathematics 2021-07-27 Zuhair Al-Johar

We study hidden-variable models from quantum mechanics, and their abstractions in purely probabilistic and relational frameworks, by means of logics of dependence and independence, based on team semantics. We show that common desirable…

Logic in Computer Science · Computer Science 2022-01-28 Rafael Albert , Erich Grädel

Substitute relationships are fundamental to people's daily lives across various domains. This study aims to comprehend and predict substitute relationships among products in diverse fields, extensively analyzing the application of machine…

Information Retrieval · Computer Science 2024-04-16 Anxin Yang , Zhijuan Du , Tao Sun

We review a bit our earlier novel string field theory\cite{self2,self8} stressing the interesting property, that it becomes expressed in terms of particle like objects called by us "objects" which in our formalism do not at all develop in…

High Energy Physics - Theory · Physics 2020-11-11 Holger Bech Nielsen , Masao Ninomiya

The Wess-Zumino term of the spinning string is constructed in terms of their anomalies using an extended field-antifield formalism. A new feature appears from a fact that the non-anomalous transformations do not form a sub-group. The…

High Energy Physics - Theory · Physics 2009-10-30 J. Gomis , K. Kamimura , R. Kuriki

There is much interest in providing probabilistic semantics for defaults but most approaches seem to suffer from one of two problems: either they require numbers, a problem defaults were intended to avoid, or they generate peculiar side…

Artificial Intelligence · Computer Science 2013-04-10 Eric Neufeld , David L Poole

In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular…

Formal Languages and Automata Theory · Computer Science 2015-08-20 Robert Mercaş

We study the problem of classification with a reject option for a fixed predictor, applicable in natural language processing. We introduce a new problem formulation for this scenario, and an algorithm minimizing a new surrogate loss…

Machine Learning · Computer Science 2023-02-01 Christopher Mohri , Daniel Andor , Eunsol Choi , Michael Collins

The variance of primes in short intervals relates to the Riemann Hypothesis, Montgomery's Pair Correlation Conjecture and the Hardy--Littlewood Conjecture. In regards to its asymptotics, very little is known unconditionally. We study the…

Number Theory · Mathematics 2024-10-31 Ofir Gorodetsky

Independence -- the study of what is relevant to a given problem of reasoning -- has received an increasing attention from the AI community. In this paper, we consider two basic forms of independence, namely, a syntactic one and a semantic…

Artificial Intelligence · Computer Science 2011-06-24 J. Lang , P. Liberatore , P. Marquis

We give a theoretical model of conjunctions $E\wedge F$ and implications $E\implies F$ where $F$ is meaningful only when $E$ is true, a situation which is very often encountered in everyday mathematics, and which was already formalized by…

Logic · Mathematics 2018-05-10 Matthieu Herrmann , Alain Prouté

The objective of this article is to prove the necessity statement in Crawley-Boevey's conjectural solution to the (tame) Deligne-Simpson problem. We use the nonabelian Hodge correspondence, variation of parabolic weights and results of…

Representation Theory · Mathematics 2025-09-24 Cheng Shu

This paper proposes a decision theory for a symbolic generalization of probability theory (SP). Darwiche and Ginsberg [2,3] proposed SP to relax the requirement of using numbers for uncertainty while preserving desirable patterns of…

Artificial Intelligence · Computer Science 2012-08-01 Phan H. Giang , Sathyakama Sandilya

A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative…

Logic · Mathematics 2020-02-27 Almudena Colacito , Nikolaos Galatos , George Metcalfe

Negation and uncertainty modeling are long-standing tasks in natural language processing. Linguistic theory postulates that expressions of negation and uncertainty are semantically independent from each other and the content they modify.…

Computation and Language · Computer Science 2022-04-04 Jake Vasilakes , Chrysoula Zerva , Makoto Miwa , Sophia Ananiadou