English
Related papers

Related papers: The Notion "Pathology" in Set Theory

200 papers

In the classification of complete first-order theories, many dividing lines have been defined in order to understand the complexity and the behavior of some classes of theories. In this paper, using the concept of patterns of consistency…

Logic · Mathematics 2025-07-08 Michele Bailetti

Effectus theory is a relatively new approach to categorical logic that can be seen as an abstract form of generalized probabilistic theories (GPTs). While the scalars of a GPT are always the real unit interval [0,1], in an effectus they can…

Category Theory · Mathematics 2021-09-07 Kenta Cho , Bas Westerbaan , John van de Wetering

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

Best possible bounds are established for families without s pairwise disjoint members and the more general problem for several families. The results are shown to apply several classical results.

Combinatorics · Mathematics 2019-04-24 Peter Frankl

Category theory gives a mathematical characterization of naturality but not of canonicity. The purpose of this paper is to develop the logical theory of canonical maps based on the broader demonstration that the dual notions of elements &…

Category Theory · Mathematics 2024-10-07 David Ellerman

Ontological models are attempts to quantitatively describe the results of a probabilistic theory, such as Quantum Mechanics, in a framework exhibiting an explicit realism-based underpinning. Unlike either the well known quasi-probability…

Quantum Physics · Physics 2008-07-02 Nicholas Harrigan , Terry Rudolph , Scott Aaronson

We view sorites in terms of stimuli acting upon a system and evoking this system's responses. Supervenience of responses on stimuli implies that they either lack tolerance (i.e., they change in every vicinity of some of the stimuli), or…

Artificial Intelligence · Computer Science 2015-04-27 Damir D. Dzhafarov , Ehtibar N. Dzhafarov

In this paper we investigate certain systems of propositional intuitionistic modal logic defined semantically in terms of neighborhood structures. We discuss various restrictions imposed on those frames but our constant approach is to…

Logic · Mathematics 2018-01-19 Tomasz Witczak

Informally speaking, the categoricity of an axiom system means that its non-logical symbols have only one possible interpretation that renders the axioms true. Although non-categoricity has become ubiquitous in the second half of the 20th…

Logic · Mathematics 2020-05-26 Jouko Väänänen

An approach to fault isolation that exploits vastly incomplete models is presented. It relies on separate descriptions of each component behavior, together with the links between them, which enables focusing of the reasoning to the relevant…

Artificial Intelligence · Computer Science 2013-02-21 Didier Cayrac , Didier Dubois , Henri Prade

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

We consider a set-theoretic version of mereology based on the inclusion relation $\subseteq$ and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of $\in$ from $\subseteq$, we identify…

Logic · Mathematics 2016-04-27 Joel David Hamkins , Makoto Kikuchi

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

Combinatorics · Mathematics 2025-05-16 J. Pascal Gollin , Jay Lilian Kneip

We formulate and explore two basic axiomatic systems of typefree subjective probability. One of them explicates a notion of finitely additive probability. The other explicates a concept of infinitely additive probability. It is argued that…

Logic · Mathematics 2022-03-10 Cezary Cieslinski , Leon Horsten , Hannes Leitgeb

We explore "omitted label contexts," in which training data is limited to a subset of the possible labels. This setting is standard among specialized human experts or specific, focused studies. By studying Simpson's paradox, we observe that…

Machine Learning · Computer Science 2025-05-02 Bijan Mazaheri , Siddharth Jain , Matthew Cook , Jehoshua Bruck

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

Discussions on causal relations in real life often consider variables for which the definition of causality is unclear since the notion of interventions on the respective variables is obscure. Asking 'what qualifies an action for being an…

Methodology · Statistics 2022-11-17 Dominik Janzing , Sergio Hernan Garrido Mejia

Causality has been often confused with the notion of determinism. It is mandatory to separate the two notions in view of the debate about quantum foundations. Quantum theory provides an example of causal not-deterministic theory. Here we…

Quantum Physics · Physics 2015-01-15 Giacomo M. D'Ariano , Franco Manessi , Paolo Perinotti

The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…

Logic · Mathematics 2007-05-23 Alexander Berenstein , C. Ward Henson

The objective of this article is to formalize the definition of NP problems. We construct a mathematical model of discrete problems as independence systems with weighted elements. We introduce two auxiliary sets that characterize the…

Data Structures and Algorithms · Computer Science 2007-05-23 Anatoly D. Plotnikov
‹ Prev 1 4 5 6 7 8 10 Next ›