The Bulletin of Symbolic Logic, Volume 14Association for Symbolic Logic, 2008 - Logic, Symbolic and mathematical |
Contents
On the computational complexity of the numerically definite syllogistic and related | 1 |
logics by IAN PRATTHARTMANN 11172 | 29 |
The complexity of orbits of computably enumerable sets by PETER A CHOLAK | 69 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
abstract algorithm Applied argument arithmetic Association for Symbolic assumption formulas automatic copy automatically presentable automatically presentable structures automaton automorphism axiomatization axioms BL-algebras Boolean algebra cardinal Cohen Comp complete Computer Science construction continuous t-norms Corollary countable defined definition denoted Department of Mathematics Dept domain E-mail editors elements equivalent example extended fact finite first-order first-order logic formal function fuzzy logic fuzzy set Gentzen Gödel graph hillock hyperbolic groups inference figure infinite int(s int(x interpretation intuitionistic isomorphism language Lemma linear order Łukasiewicz Math Mathematical Logic model theory natural deduction natural numbers notion operations ordinal Philos Philosophy postulates predicate problem Program proof proof nets propositional quantifiers recursive regular satisfies semantics set theory similarity relation sofic strings subset Symbolic Logic t-norm T-structures Tarski's Theorem thesis topology truth degree Turing ultraproduct unary Univ University variables