Sciweavers

40 search results - page 4 / 8
» Axioms for Recursion in Call-by-Value
Sort
View
ARTS
1999
Springer
13 years 11 months ago
Process Algebra with Probabilistic Choice
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this probl...
Suzana Andova
ACL
1993
13 years 8 months ago
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Rolf Backofen, Gert Smolka
LOGCOM
2007
84views more  LOGCOM 2007»
13 years 7 months ago
A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions
Harvey Friedman introduced natural independence results for the Peano axioms via certain schemes of combinatorial well-foundedness. We consider here parameterized versions of this...
Arnoud den Boer, Andreas Weiermann
AIMSA
1990
Springer
13 years 11 months ago
Compilation of Recursive Two-Literal Clauses into Unification Algorithms
: Automated deduction systems can considerably be improved by replacing axioms with special purpose inference mechanisms. For example replacing in resolution based systems certain ...
Hans Jürgen Ohlbach
AML
2005
101views more  AML 2005»
13 years 7 months ago
Forcing and antifoundation
It is proved that the forcing apparatus can be built and set to work in ZFCA (=ZFC minus foundation plus the antifoundation axiom AFA). The key tools for this construction are gre...
Athanassios Tzouvaras