36 search results - page 2 / 8 » A Natural Model of the Multiverse Axioms |
103
Voted
AML
2005
15 years 1 months ago
2005
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...
114
Voted
WOLLIC
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...
DAGSTUHL
2007
15 years 3 months ago
2007
ABSTRACT: In this paper I present the model of ‘bounded revision’ that is based on two-dimensional revision functions taking as arguments pairs consisting of an input sentence ...
121
Voted
CIE
2005
Springer
15 years 7 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
WWW
2009
ACM
16 years 2 months ago
2009
ACM
This paper presents SOFIE, a system for automated ontology extension. SOFIE can parse natural language documents, extract ontological facts from them and link the facts into an on...