Sciweavers

91 search results - page 17 / 19
» aml 2007
Sort
View
AML
2006
120views more  AML 2006»
13 years 8 months ago
On the infinite-valued Lukasiewicz logic that preserves degrees of truth
Lukasiewicz's infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Lukasiewicz algebra on the unit real interva...
Josep Maria Font, Àngel J. Gil, Antoni Torr...
AML
2005
101views more  AML 2005»
13 years 8 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
AML
1998
60views more  AML 1998»
13 years 8 months ago
A restricted computation model on Scott domains and its partial primitive recursive functionals
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
Karl-Heinz Niggl
AML
2007
56views more  AML 2007»
13 years 8 months ago
Radin forcing and its iterations
We provide an exposition of supercompact Radin forcing and present several methods for iterating Radin forcing. In this paper we give an exposition of supercompact Radin forcing us...
John Krueger
AML
2007
68views more  AML 2007»
13 years 8 months ago
A note on weak dividing
We study the notion of weak dividing introduced by S. Shelah. In particular we prove that T is stable iff weak dividing is symmetric. In order to study simple theories Shelah orig...
Byunghan Kim, Niandong Shi