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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

Some measures of randomness have been introduced for Martin-Löf randomness such as K-reducibility, C-reducibility and vL…

2016

In this work we consider the servers load balancing problem (SLBP) formulated as a mixed integer linear programming problem. As…

2016

Gold (3 wt. %) catalysts on Y-doped (1, 2.5, 5 and 7.5 wt. % Y2O3) ceria supports prepared by coprecipitation (CP) or…

2015

A graph with four special vertices (called terminals) is wye-delta reducible if we can obtain a graph on four vertices by a…

2013

Ramification1 is fundamentally a theory of quantification. It says that no proposition can quantify over itself (or over…

2011

Abstract:The axiom of reducibility plays an important role in the logic of Principia Mathematica, but has generally been…

2006

We investigate strong versions of enumeration reducibility, the most important one being s-reducibility. We prove that every…

1985

Lachlan [7] and, independently, Yates t-t9] showed that there exist minimal pairs of r.e. (Turing) degrees, namely incomparable r…

1984

Abstract Let A and B be subsets of the space 2N of sets of natural numbers. A is said to be Wadge reducible to B if there is a…

1981

We compare two notions to measure the expressive power of various dynamic logics: Reducibility and AP-reducibility. With those…