English
Related papers

Related papers: Univalence and Ontic Structuralism

200 papers

It is well known that univalence is incompatible with uniqueness of identity proofs (UIP), the axiom that all types are h-sets. This is due to finite h-sets having non-trivial automorphisms as soon as they are not h-propositions. A natural…

Logic in Computer Science · Computer Science 2020-05-04 Christian Sattler , Andrea Vezzosi

We investigate the impact of diffeomorphisms where more than one nonequivalent spinor structure is built upon a given base manifold endowed with nontrivial topology. We call attention to the fact that a relatively straightforward…

Mathematical Physics · Physics 2025-11-17 J. M. Hoff da Silva

Convex geometries form a subclass of closure systems with unique criticals, or $UC$-systems. We show that the $F$-basis introduced in [1] for $UC$-systems, becomes optimum in convex geometries, in two essential parts of the basis: right…

Optimization and Control · Mathematics 2016-02-02 Kira Adaricheva

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

This paper reviews the hole argument as an argument against spacetime substantivalism. After a careful presentation of the argument itself I review possible responses.

History and Philosophy of Physics · Physics 2020-09-22 Oliver Pooley

Ontologies have been used for the purpose of bringing system and consistency to subject and knowledge areas. We present a criticism of the present mathematical structure of ontologies and indicate that they are not sufficient in their…

Digital Libraries · Computer Science 2015-03-12 Philip Davies , David Newell , Abigail Davies , Damla Karagozlu

Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…

Logic · Mathematics 2012-11-06 Francesco Ciraulo , Maria Emilia Maietti , Giovanni Sambin

Ontologies enable knowledge sharing and interdisciplinary collaboration by providing standardized, structured vocabularies for diverse communities. While logical axioms are a cornerstone of ontology design, natural language elements such as…

Formal Languages and Automata Theory · Computer Science 2025-08-29 Paul Fabry , Adrien Barton , Jean-François Éthier

An alternative approach to the Standard Model is outlined, being motivated by the increasing theoretical and experimental difficulties encountered by this model, which furthermore fails to be unitary. In particular, the conceptual…

High Energy Physics - Phenomenology · Physics 2015-06-25 G. Sardin

This paper deals with certain fundamental results about affine hulls and simplices in a real normed linear space. The framework of the paper is Bishop's constructive mathematics, which, with its characteristic interpretation of existence as…

Logic · Mathematics 2025-09-26 Douglas S. Bridges

This is an explanation and defense of "mathematical conceptualism" for a general mathematical and philosophical audience. I make a case that it is cogent, rigorous, attractive, and better suited to ordinary mathematical practice than all…

Logic · Mathematics 2007-05-23 Nik Weaver

Many introductions to homotopy type theory and the univalence axiom gloss over the semantics of this new formal system in traditional set-based foundations. This expository article, written as lecture notes to accompany a 3-part mini course…

Category Theory · Mathematics 2024-03-04 Emily Riehl

An introduction is given to the logic of sheaves of structures and to set theoretic forcing constructions based on this logic. Using these tools, it is presented an alternative proof of the independence of the Continuum Hypothesis; which…

Logic · Mathematics 2012-02-08 J. Benavides

Explaining autonomous and intelligent systems is critical in order to improve trust in their decisions. Counterfactuals have emerged as one of the most compelling forms of explanation. They address ``why not'' questions by revealing how…

Artificial Intelligence · Computer Science 2026-02-05 Leila Amgoud , Martin Cooper

This position statement looks back on two decades of work on shallow embeddings of non-classical logics in classical higher-order logic (HOL), a line of research that expanded into a range of logic embeddings in HOL and inspired the LogiKEy…

Logic in Computer Science · Computer Science 2026-05-27 Christoph Benzmüller , Daniel Kirchner , Luca Pasetto

The factorizable vectors of a complete Boolean algebra of type I factors, acting on a separable Hilbert space, are shown to be total, resolving a conjecture of Araki and Woods. En route, the spectral theory of noise-type Boolean algebras of…

Operator Algebras · Mathematics 2024-08-06 Matija Vidmar

A classical logic exhibits a threefold inner structure comprising an algebra of propositions `A', a space of ``truth values'' `V', and a distinguished family of mappings `phi' from propositions to truth values. Classically A is a Boolean…

Quantum Physics · Physics 2008-11-26 Rafael D. Sorkin

In order to make the fundamental group, one of the most well known invariants in algebraic topology, more useful and powerful some researchers have introduced and studied various topologies on the fundamental group from the beginning of the…

Algebraic Topology · Mathematics 2025-08-28 Naghme Shahami , Behrooz Mashayekhy

This talk presents foundations of mathematics as a historically variable set of principles appealing to various modes of human intuition and devoid of any prescriptive/prohibitive power. At each turn of history, foundations crystallize the…

History and Overview · Mathematics 2012-05-29 Yuri I. Manin

This paper investigates how global decision problems over arithmetically represented domains acquire reflective structure through class-quantification. Arithmetization forces diagonal fixed points whose verification requires reflection…

Computational Complexity · Computer Science 2025-11-19 Milan Rosko