17 search results - page 2 / 4 » Strong and weak forms of abstract argument defense |
JSYML
1998
13 years 5 months ago
1998
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
LPAR
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We distill Penrose’s argument against the “artificial intelligence premiss”, and analyze its logical alternatives. We then clarify the different positions one can...
WDAG
1993
Springer
13 years 9 months ago
1993
Springer
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...
LPNMR
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
JSYML
2011
12 years 8 months ago
2011
This paper continues the study of the Ramsey-like large cardinals introduced in [Git09] and [WS08]. Ramsey-like cardinals are defined by generalizing the “existence of elementar...