91 search results - page 10 / 19 » aml 2007 |
AML
2007
13 years 10 months ago
2007
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
AML
2007
13 years 10 months ago
2007
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each...
AML
2007
13 years 10 months ago
2007
In this paper we will prove that the plus cupping degrees generate a definable ideal on c.e. degrees different from other ones known so far, thus answer a question asked by A. Li...
AML
2007
13 years 10 months ago
2007
The main result of this paper is a partial answer to [7, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determ...
AML
2006
13 years 10 months ago
2006
If the Visser rules are admissible for an intermediate logic, they form a basis for the admissible rules of the logic. How to characterize the admissible rules of intermediate log...