Results 41 to 50 of about 1,125 (159)
An unprovable Ramsey-type theorem [PDF]
Proceedings of the American Mathematical Society, 1992 We present a new proof of the Paris-Harrington unprovable (in PA) version of Ramsey’s theorem. This also yields a particularly short proof of the Ketonen-Solovay result on rapidly growing Ramsey functions.
Loebl, Martin, Nešetřil, Jaroslav
openaire +2 more sources
Secure Authentication via Quantum Physical Unclonable Functions: A Review
Advanced Quantum Technologies, Volume 9, Issue 1, January 2026.This in‐depth review article examines the origins, development, and evolution of Quantum Physical Unclonable Functions (QPUFs), with a particular focus on their use in secure authentication. The topic is motivated and introduced in detail, addressing both theoretical foundations and practical implementations, and is supported by a systematic article ...
Pol Julià Farré +8 more
wiley +1 more source
Financialisation and the (De‐)Unionisation of Workers in Portugal
Industrial Relations Journal, Volume 57, Issue 1, Page 59-74, January 2026.ABSTRACT Over the last five decades, the degree of unionisation of workers has been decreasing and, therefore, by inadvertently accepting the deterioration of labour relations, the loss of labour rights, and the increase in the exploitation of labour all over the world, workers have not genuinely contested the neoliberal agenda and the deregulation and
Ricardo Barradas
wiley +1 more source
Do expected utility maximizers have commitment issues?
Philosophy and Phenomenological Research, Volume 112, Issue 1, Page 3-23, January 2026.Abstract Critics have argued that expected utility theory fails as a theory of rational choice for diachronic agents who expect their preferences to change in response to temptations. According to this criticism, such agents cannot rationally commit to executing a sequence of actions, even when doing so would produce outcomes they consistently prefer ...
Paul de Font‐Reaulx
wiley +1 more source
Easton's theorem for Ramsey and strongly Ramsey cardinals
Annals of Pure and Applied Logic, 2015 We show that, assuming GCH, if $ $ is a Ramsey or a strongly Ramsey cardinal and $F$ is a class function on the regular cardinals having a closure point at $ $ and obeying the constraints of Easton's theorem, namely, $F( )\leq F( )$ for $ \leq $ and $
Cody, Brent, Gitman, Victoria
openaire +2 more sources
Hybrid Deference, Hybrid Chance
Philosophy and Phenomenological Research, Volume 112, Issue 1, Page 214-233, January 2026.ABSTRACT If you learn about one kind of chance and nothing else, then you should defer to those chances. But what if you learn about more than one kind of chance? In such “hybrid” cases, familiar chance‐credence principles, like the Principal Principle, go silent when they should intuitively speak.
Alexander Meehan
wiley +1 more source
Pi01 encodability and omniscient reductions
, 2016 A set of integers $A$ is computably encodable if every infinite set of integers has an infinite subset computing $A$. By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones.
Monin, Benoit, Patey, Ludovic
core +2 more sources
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract Sunflowers, or Δ$\Delta$‐systems, are a fundamental concept in combinatorics introduced by Erdős and Rado in their paper: [J. London Math. Soc. (1) 35 (1960), 85–90]. A sunflower is a collection of sets where all pairs have the same intersection.
Anup Rao
wiley +1 more source
Fast Construction on a Restricted Budget
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT We introduce a model of a controlled random graph process. In this model, the edges of the complete graph Kn$$ {K}_n $$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably, whether to purchase each observed edge.
Alan Frieze +2 more
wiley +1 more source
Hypergraph Anti‐Ramsey Theorems
Journal of Graph TheoryABSTRACTThe anti‐Ramsey number of an ‐graph is the minimum number of colors needed to color the complete ‐vertex ‐graph to ensure the existence of a rainbow copy of . We establish a removal‐type result for the anti‐Ramsey problem of when is the expansion of a hypergraph with a smaller uniformity. We present two applications of this result.
Xizhi Liu, Jialei Song
openaire +2 more sources