Result 1 to 20 from 54 total
Quantum deduction rules. (English)
Ann. Pure Appl. Logic 157, No. 1, 16-29 (2009).
1
Markov’s constructivism in some problems of theoretical informatics. ({\cyr Markovskii0 konstruktivizm v ryade problem teoreticheskoi0 informatiki}.) (Russian)
Moscow: Rossiĭskaya Akademiya Nauk, Vychislitel’nyĭ Tsentr im. A. A. Dorodnitsyna (ISBN 978-5-91601-003-9). 204~p. (2008).
2
Partial Conway and iteration semirings. (English)
Fundam. Inform. 86, No. 1-2, 19-40 (2008).
3
Computation, hypercomputation, and physical science. (English)
J. Appl. Log. 6, No. 4, 461-475 (2008).
4
Fine hierarchies and m-reducibilities in theoretical computer science. (English)
Theor. Comput. Sci. 405, No. 1-2, 116-163 (2008).
5
Some algebraic properties of machine poset of infinite words. (English)
Theor. Inform. Appl. 42, No. 3, 451-466 (2008).
6
An introduction to non-classical logic. Transl. from the English and edited by Stephan Cursiefen and Tanja Osswald. With the collaboration of Miriam Ossa. (Einführung in die nicht-klassische Logik.) (German)
Paderborn: Mentis (ISBN 978-3-89785-542-7/pbk). xii, 306~p. EUR~26.80; SFR~45.80 (2008).
7
On explicating the concept ‘the power of an arithmetical theory’. (English)
J. Philos. Log. 37, No. 2, 183-202 (2008).
8
Information and knowledge. A constructive type-theoretical approach. (English)
Logic, Epistemology, and the Unity of Science 10. Berlin: Springer (ISBN 978-1-4020-6169-1/hbk). ix, 208~p. EUR~144.40 (2008).
9
Deduction, induction, and beyond in parametric logic. (English)
Friend, Michèle (ed.) et al., Induction, algorithmic learning theory, and philosophy. Dordrecht: Springer (ISBN 978-1-4020-6126-4/hbk). Logic, Epistemology, and the Unity of Science 9, 55-110 (2007).
10
What is a computation? (English)
Calude, Cristian S. (ed.), Randomness and complexity. From Leibniz to Chaitin. Dedicated to Gregory J. Chaitin on the occasion of his 60th birthday. Hackensack, NJ: World Scientific (ISBN 978-981-277-082-0/hbk). 89-122 (2007).
11
Truth, modality and intersubjectivity. (English)
Math. Struct. Comput. Sci. 17, No. 6, 1153-1167 (2007).
12
Rényi-Ulam game semantics for product logic and for the logic of cancellative hoops. (English)
Aguzzoli, Stefano (ed.) et al., Algebraic and proof-theoretic aspects of non-classical logics. Papers in honor of Daniele Mundici on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-540-75938-6/pbk). Lecture Notes in Computer Science 4460. Lecture Notes in Artificial Intelligence, 231-246 (2007).
13
The future of complexity. Conceiving a better way to understand order and chaos. (English)
Hackensack, NJ: World Scientific (ISBN 978-981-270-898-4/hbk; 978-981-270-900-4/ebook). xxii, 295~p. \$~84.00, \sterling~45.00/hbk; \$~109.00; \sterling~59.00/ebook (2007).
14
Incompleteness in a general setting. (English)
Bull. Symb. Log. 13, No. 1, 21-30 (2007); corrigendum ibid. 14, No. 1, 122 (2008).
15
The mathematics of logic. A guide to completeness theorems and their applications. (English)
Cambridge: Cambridge University Press (ISBN 978-0-521-88219-4/hbk; 978-0-521-70877-7/pbk). xii, 204~p. \sterling~19.99, \$~39.99/pbk; \sterling~55.00, \$~99.00/hbk (2007).
16
Connecting many-sorted theories. (English)
J. Symb. Log. 72, No. 2, 535-583 (2007).
17
I am a strange loop. (English)
New York, NY: Basic Books (ISBN 978-0-465-03078-1/hbk). xix, 412~p. \$~26.95; \sterling~15.99 (2007).
18
Exponential vs. factorial. (English)
Am. Math. Mon. 113, No. 8, 689-704 (2006).
19
A new measure of the difficulty of problems. (English)
J. Mult.-Val. Log. Soft Comput. 12, No. 3-4, 285-307 (2006).
20
Result 1 to 20 from 54 total
Start
Contact
Print
General Help
