Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,506,718 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Hilbert system
History of type theory
Impredicativity
Intension
Expand
Broader (1)
Type theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Genetic Local Search for the Servers Load Balancing Problem
Y. Kochetov
,
A. Panin
,
A. Plyasunov
International Conference on Discrete Optimization…
2016
Corpus ID: 15931998
In this work we consider the servers load balancing problem (SLBP) formulated as a mixed integer linear programming problem. As…
Expand
2014
2014
Reducibilities Relating to Schnorr Randomness
Kenshi Miyabe
Theory of Computing Systems
2014
Corpus ID: 253741808
Some measures of randomness have been introduced for Martin-Löf randomness such as K-reducibility, C-reducibility and vL…
Expand
2013
2013
CONSISTENT INTERACTIONS BETWEEN DUAL FORMULATIONS OF LINEARISED GRAVITY IN TERMS OF MASSLESS TENSOR FIELDS WITH MIXED SYMMETRIES (k;1) AND (2;2)
C. Bizdadea
,
M. Toma
,
S. Saliu
,
M. T. Miaută
2013
Corpus ID: 17744628
Two particular types of consistent interactions of a single massless tensor field with the mixed symmetry corresponding to a two…
Expand
2007
2007
We Are Grateful for the Useful Feedback from and Discussions with Henk Barendregt
H. Barendregt
,
A. Blass
,
I. Grattan-Guinness
,
R. Hindley
2007
Corpus ID: 14422599
In this article, we study the prehistory of type theory up to 1910 and its development betweenRussell andWhitehead…
Expand
2006
2006
Reply to Ruphy
C. Moulines
Synthese
2006
Corpus ID: 19666911
There aren’t many sources of disagreement between Dr. Ruphy and myself on the subject of ontology and reduction; she seems to…
Expand
2006
2006
CONSTRUCTING MINIMAL PAIRS OF DEGREES
Ivan N. Soskov
2006
Corpus ID: 17283857
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…
Expand
2005
2005
Study of CO Oxidation Activity and Chemical Characterisation of Cu/CeO2 Powder
B. Šmíd
,
M. Skoda
,
I. Matolínová
,
L. Sedláček
,
V. Matolín
2005
Corpus ID: 18644885
The catalytic activity for CO oxidation over cerium dioxide (CeO2) and Cu-modified ceria (Cu/CeO2) powders prepared by wetness…
Expand
2002
2002
Note on the Relation between S-reducibility, S-coreducibility and Stable Homotopy Types of Some Stunted Lens Spaces
Y. Kotani
2002
Corpus ID: 59319339
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…
Expand
1981
1981
Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory
J. Makowsky
International Colloquium on Automata, Languages…
1981
Corpus ID: 9413978
We compare two notions to measure the expressive power of various dynamic logics: Reducibility and AP-reducibility. With those…
Expand
1978
1978
Hyperenumeration reducibility
L. E. Sanchis
Notre Dame J. Formal Log.
1978
Corpus ID: 43287646