中文
相关论文

相关论文: The strength of replacement in weak arithmetic

200 篇论文

The set-theoretic axiom WISC states that for every set there is a set of surjections to it cofinal in all such surjections. By constructing an unbounded topos over the category of sets and using an extension of the internal logic of a topos…

范畴论 · 数学 2015-08-27 David Michael Roberts

We extend de Finetti's (1937) notion of exchangeability to finite and countable sequences of variables, when a subject's beliefs about them are modelled using coherent lower previsions rather than (linear) previsions. We prove…

概率论 · 数学 2008-01-09 Gert de Cooman , Erik Quaeghebeur , Enrique Miranda

In this article we generalize Cobham theorem to a large class of substitutions including non primitive and non constant length substitutions.

组合数学 · 数学 2008-01-08 Fabien Durand

Different techniques have been used to prove several transference theorems of the form "nontrivial algorithms for a circuit class C yield circuit lower bounds against C". In this survey we revisit many of these results. We discuss how…

计算复杂性 · 计算机科学 2013-09-03 Igor C. Oliveira

We consider highly inaccurate measurements made on classical stochastic and quantum systems. In the quantum case such a \e{weak} measurement preserves coherence between the system's alternatives. We demonstrate that in both cases the…

量子物理 · 物理学 2026-03-16 D. Sokolovski , D. Alonso , S. Brouard

We improve upon Huntington's affine geometry by showing that his independence proofs can be, in some cases, simplified. We carry out a systematic investigation of the strict notion of betweenness that Huntington employs (the three arguments…

逻辑 · 数学 2013-12-17 Jesse Alama

We introduce a new criterion, replacement freeness, to discern the relative expressiveness of process calculi. Intuitively, a calculus is strongly replacement free if replacing, within an enclosing context, a process that cannot perform any…

计算机科学中的逻辑 · 计算机科学 2010-12-01 Federico Banti , Rosario Pugliese , Francesco Tiezzi

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

概率论 · 数学 2009-03-06 Eugenijus Manstavičius

Methods for choosing from a set of options are often based on a strict partial order on these options, or on a set of such partial orders. I here provide a very general axiomatic characterisation for choice functions of this form. It…

人工智能 · 计算机科学 2020-04-03 Jasper De Bock

Coin flipping is a cryptographic primitive for which strictly better protocols exist if the players are not only allowed to exchange classical, but also quantum messages. During the past few years, several results have appeared which give a…

量子物理 · 物理学 2011-04-27 Esther Hänggi , Jürg Wullschleger

We give a sufficient condition for a model theoretic structure $B$ to 'inherit' quantifier elimination from another structure $A$. This yields an alternative proof of one of the main result from \cite{kle}, namely quantifier elimination for…

逻辑 · 数学 2025-03-25 Maximilian Illmer , Tim Netzer

Recent work on the logical structure of non-locality has constructed scenarios where observations of multi-partite systems cannot be adequately described by compositions of non-signaling subsystems. In this paper we apply these frameworks…

计算机科学与博弈论 · 计算机科学 2015-12-10 William Zeng , Philipp Zahn

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

综合数学 · 数学 2007-05-23 W. Mueckenheim

This paper provides a comprehensive overview of some of the foundational properties of categories enriched over quantaloids, along with several new results. We demonstrate that the category whose objects are quantaloid-enriched categories…

范畴论 · 数学 2025-10-14 Javier Gutiérrez García , Ulrich Höhle

Whenever a mathematical proposition to be proved requires more information than it is contained in an axiomatic system, it can neither be proved nor disproved, i.e. it is undecidable, or logically undetermined, within this axiomatic system.…

量子物理 · 物理学 2009-12-06 Caslav Brukner

Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…

逻辑 · 数学 2023-05-18 Saeed Salehi

This paper presents a theory of non-linear integer/real arithmetic and algorithms for reasoning about this theory. The theory can be conceived as an extension of linear integer/real arithmetic with a weakly-axiomatized multiplication…

计算机科学中的逻辑 · 计算机科学 2022-11-09 Zachary Kincaid , Nicolas Koh , Shaowei Zhu

Choice overload - in which larger choice sets are detrimental to a chooser's well-being - is potentially of great importance in the design of economic policy. Yet the current evidence on its prevalence is inconclusive. We argue that…

综合经济学 · 经济学 2025-06-27 Mark Dean , Dilip Ravindran , Jörg Stoye

The main observation of this paper is that some sequential weak compactness arguments in Hilbert space theory can be replaced by Heine/Borel compactness arguments (for the strong topology). Even though the latter form of compactness fails…

逻辑 · 数学 2019-07-29 Fernando Ferreira , Laurentiu Leustean , Pedro Pinto

A quantum transition can be seen as a result of interference between various pathways(e.g. Feynman paths) which can be labelled by a variable $f$. An attempt to determine the value of f without destroying the coherence between the pathways…

量子物理 · 物理学 2009-05-26 D. Sokolovski