English
Related papers

Related papers: Labeled Mereological Set Theory

200 papers

Display calculi are generalized sequent calculi which enjoy a `canonical' cut elimination strategy. That is, their cut elimination is uniformly obtained by verifying the assumptions of a meta-theorem, and is preserved by adding or removing…

Many classification problems can be difficult to formulate directly in terms of the traditional supervised setting, where both training and test samples are individual feature vectors. There are cases in which samples are better described…

Machine Learning · Statistics 2016-07-12 Veronika Cheplygina , David M. J. Tax , Marco Loog

In the first part of this expository paper, we present and discuss the interplay of Dirichlet polynomials in some classical problems of number theory, notably the Lindel\"of Hypothesis. We review some typical properties of their means and…

Number Theory · Mathematics 2017-07-13 Michel Weber

We review, for a general audience, a variety of recent experiments on extracting structure from machine-learning mathematical data that have been compiled over the years. Focusing on supervised machine-learning on labeled data from…

Machine Learning · Computer Science 2021-04-09 Yang-Hui He

The process of cognition is analysed to adjust the set theory to physical description. Postulates and basic definitions are revised. The specific sets of predicates, called presets, corresponding to the physical objects identified by an…

General Physics · Physics 2015-05-13 Andrey V. Novikov-Borodin

This text gives a rough, but linear summary covering some key definitions, notations, and propositions from Lambda Calculus: Its Syntax and Semantics, the classical monograph by Barendregt. First, we define a theory of untyped extensional…

Logic in Computer Science · Computer Science 2013-10-28 Anton Salikhmetov

A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this…

Discrete Mathematics · Computer Science 2009-10-20 Laurent Lyaudet , Frédéric Mazoit , Stephan Thomasse

We provide a formal introduction into the classic theorems of general topology and its axiomatic foundations in set theory. In this second part we introduce the fundamental concepts of topological spaces, convergence, and continuity, as…

History and Overview · Mathematics 2013-07-01 Felix Nagel

The combination of the group ring setting with the methods of character theory allows an elegant and powerful analysis of various combinatorial structures, via their character sums. These combinatorial structures include difference sets,…

History and Overview · Mathematics 2023-02-13 Jonathan Jedwab , Shuxing Li

The fundamental proposal in this article is that logical formulas of the form (f <-> ~f) are not contradictions, and that formulas of the form (t <-> t) are not tautologies. Such formulas, wherever they appear in mathematics, are instead…

Logic in Computer Science · Computer Science 2015-09-30 Timothy J. Armstrong

In the paper, using the language of spin-half particles, Hardy's paradox is examined within different semantics: a partial one, a many-valued one, and one defined as a set of weak values of projection operators. As it is shown in this…

Quantum Physics · Physics 2018-06-06 Arkady Bolotin

In this article we treat a notion of continuity for a multi-valued function $F$ and we compute the descriptive set-theoretic complexity of the set of all $x$ for which $F$ is continuous at $x$. We give conditions under which the latter set…

Logic · Mathematics 2015-07-01 Vassilios Gregoriades

Set theoretical paradoxes have a common root -- lack of understanding of why some multitudes are not sets. Why some multitudes of objects of thought cannot themselves be objects of thought? Moreover, it is a logical truth that such…

Logic · Mathematics 2021-06-01 Boris Čulina

We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…

Logic · Mathematics 2015-12-16 Pedro Sánchez Terraf

Mixed metaphors have been neglected in recent metaphor research. This paper suggests that such neglect is short-sighted. Though mixing is a more complex phenomenon than straight metaphors, the same kinds of reasoning and knowledge…

Computation and Language · Computer Science 2007-05-23 Mark Lee , John Barnden

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

Logic in Computer Science · Computer Science 2023-10-20 Alexander V. Gheorghiu , David J. Pym

We study Borel systems and continuous systems of measures, with a focus on mapping properties: compositions, liftings, fibred products and disintegration. Parts of the theory we develop can be derived from known work in the literature, and…

Functional Analysis · Mathematics 2011-01-19 Aviv Censor , Daniele Grandini

Meta-analysis is an important tool for combining results from multiple studies and has been widely used in evidence-based medicine for several decades. This paper reports, for the first time, an interesting and valuable paradox in…

Applications · Statistics 2019-05-15 Jiandong Shi , Aimin Wu , Tiejun Tong

This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent,…

Logic in Computer Science · Computer Science 2015-08-21 Eike Best , Uli Schlachter