Search Results - Abstract and axiomatic computability and recursion theory

An axiomatic study of Majority-rule (+ ) and associated consensus functions on hierarchies by Dong, Jianrong, Fernández-Baca, David, McMorris, F.R., Powers, Robert C.

“…Consensus trees have been used routinely in systematic biology for over 30 years with the majority-rule consensus tree among the most popular. In this paper we…”
Get full text

A Characterization of Majority Rule for Hierarchies by McMorris, Fred R., Powers, Robert C.

“… In this note, a new axiomatic characterization is proved for this consensus method on hierarchies…”
Get full text

CCS with Hennessy's merge has no finite-equational axiomatization by Aceto, Luca, Fokkink, Wan, Ingólfsdóttir, Anna, Luttik, Bas

“…This paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free…”
Get full text

A game-semantic model of computation by Yamada, Norihiro

“…, higher-order computation, in a more abstract fashion. As immediate corollaries, some of the well-known theorems in computability theory such as the smn theorem and the first recursion theorem are generalized…”
Get full text

A Tour Through Mathematical Logic by Wolf, Robert S.

“… It contains chapters covering elementary logic, basic set theory, recursion theory, Gödel’s (and others’) incompleteness theorems, model theory, independence results in set theory, nonstandard analysis, and constructive mathematics…”
Get full text

Definibilitas Minimaximi by Duvalier, Matthew

“…, not with computability, but with definability. Consequently, this is a dissertation in recursion theory.In the course of his investigation the author was led to the earliest and most significant theorem of game theory, namely: von…”
Get full text

A Game-Semantic Model of Computation by Yamada, Norihiro

“…, higher-order computation, in a more abstract fashion. As immediate corollaries, some of the well-known theorems in computability theory such as the smn-theorem and the first recursion theorem are generalized…”
Get full text

Proof technology and computation by Schwichtenberg, Helmut, Spies, Katharina

“…Proof technology will become an established field in software engineering. It generally aims at integrating proof processing into industrial design and…”
Get full text

Reverse mathematics, countable and uncountable: a computational approach by Shore, Richard A.

“…Abstract Reverse mathematics analyzes the complexity of mathematical statements in terms of the strength of axiomatic systems needed to prove…”
Get full text