Suchergebnisse - abstracts AND ((axiomatic OR automatic) OR automation) computability AND recursion theory*

An axiomatic study of Majority-rule (+ ) and associated consensus functions on hierarchies von 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 …”
Volltext

Grammar semantics, analysis and parsing by abstract interpretation von Cousot, Patrick, Cousot, Radhia

“… We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata …”
Volltext

Formalization of the Computational Theory of a Turing Complete Functional Language Model von Ramos, Thiago Mendonça Ferreira, Almeida, Ariane Alves, Ayala-Rincón, Mauricio

“… This work presents a formalization in PVS of the computational theory for a computational model given as a class of partial recursive functions called PVS0 …”
Volltext

Recursion leads to automatic variable blocking for dense linear-algebra algorithms von Gustavson, F. G.

“… Gustavson describes some modifications of the LAPACK dense linear-algebra algorithms using recursion, which leads to automatic variable blocking …”
Volltext

Directed Binary Hierarchies and Directed Ultrametrics von Lerman, I-C., Kuntz, P.

“… Directed binary hierarchies have been introduced in order to give a graphical reduced representation of a family of association rules. This type of structure …”
Volltext

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

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

Structural Classification Analysis of Three-Way Dissimilarity Data von Vicari, Donatella, Vichi, Maurizio

“… The paper presents a methodology for classifying three-way dissimilarity data, which are reconstructed by a small number of consensus classifications of the …”
Volltext

CCS with Hennessy's merge has no finite-equational axiomatization von 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 …”
Volltext

A game-semantic model of computation von 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 …”
Volltext

A Tour Through Mathematical Logic von 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 …”
Volltext

On Safety of Unary and Nonunary IFP Operators von Dudakov, S. M.

“… Therefore, the problem under investigation is directly related to database theory. The problem arises from the fact that if recursion and universe relations, e.g …”
Volltext

A Game-Semantic Model of Computation von 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 …”
Volltext

Proof technology and computation von 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 …”
Volltext

Definibilitas Minimaximi von 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 …”
Volltext

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

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