Skip to search formSkip to main contentSkip to account menu

Axiom of reducibility

The axiom of reducibility was introduced by Bertrand Russell in the early 20th century as part of his ramified theory of types. Russell devised and… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this work we consider the servers load balancing problem (SLBP) formulated as a mixed integer linear programming problem. As… 
2014
2014
Some measures of randomness have been introduced for Martin-Löf randomness such as K-reducibility, C-reducibility and vL… 
2013
2013
Two particular types of consistent interactions of a single massless tensor field with the mixed symmetry corresponding to a two… 
2007
2007
In this article, we study the prehistory of type theory up to 1910 and its development betweenRussell andWhitehead… 
2006
2006
There aren’t many sources of disagreement between Dr. Ruphy and myself on the subject of ontology and reduction; she seems to… 
2006
2006
We prove that there exist sets of natural numbers A and B such that A and B form a minimal pair with respect to Turing… 
2005
2005
The catalytic activity for CO oxidation over cerium dioxide (CeO2) and Cu-modified ceria (Cu/CeO2) powders prepared by wetness… 
2002
2002
Let q ≥ 2 and n ≥ 0 be integers. Let L2n+1 q = S2n+1/(Z/q) be the (2n+1)dimensional mod q lens space and L2n q the 2n-skeleton of… 
1981
1981
We compare two notions to measure the expressive power of various dynamic logics: Reducibility and AP-reducibility. With those… 
1978
1978