Result 1 to 20 of 39 total
On the admissible sets of type ${\bbfH}{\bbfY}{\bbfP}(\frak M)$ over recursively saturated models. (English)
Sib. Math. J. 52, No. 6, 951-968 (2011); translation from Sib. Mat. Zh. 52, No. 6, 1199-1220 (2011).
1
Binding without identity: Towards a unified semantics for bound and exempt anaphors. (English)
Lalitha Devi, Sobha (ed.) et al., Anaphora processing and applications. 7th discourse anaphora and anaphor resolution colloquium, DAARC 2009, Goa, India, November 5‒6, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04974-3/pbk). Lecture Notes in Computer Science 5847. Lecture Notes in Artificial Intelligence, 69-79 (2009).
2
Exponential extension of a class of elementary Skolem functions and bounded superpositions of simple arithmetic functions. (Russian)
Mat. Vopr. Kibern. 16, 163-190 (2007).
3
On positive theories of groups with regular free length functions. (English)
Int. J. Algebra Comput. 17, No. 1, 1-26 (2007).
4
Implicit function theorem over free groups. (English)
J. Algebra 290, No. 1, 1-203 (2005).
5
The pragmatic dimension of indefinites. (English)
Res. Lang. Comput. 2, No. 3, 365-399 (2004).
6
Skolem functions of arithmetical sentences. (English)
Inf. Comput. 185, No. 1, 56-65 (2003).
7
Primitive recursive analogues of the least regular cardinal and the least weakly inaccessible cardinal. (English)
Sci. Math. Jpn. 57, No.1, 103-111 (2003).
8
Intuitionistic logic as epistemic logic. (English)
Synthese 127, No.1-2, 7-19 (2001).
9
Trees and Keisler’s problem. (English)
Arch. Math. Logic 40, No.4, 273-276 (2001).
10
A new method for establishing conservativity of classical systems over their intuitionistic version. (English)
Math. Struct. Comput. Sci. 9, No.4, 323-333 (1999).
11
Uniformization theorem in hereditarily finite superstructures. (Russian)
Vychisl. Sist. 161, 3-14 (1998).
12
Elimination of Skolem functions for monotone formulas in analysis. (English)
Arch. Math. Logic 37, No.5-6, 363-390 (1998).
13
Uniformization and Skolem functions in the class of trees. (English)
J. Symb. Log. 63, No.1, 103-127 (1998).
14
Minimal realizability of intuitionistic arithmetic and elementary analysis. (English)
J. Symb. Log. 60, No.4, 1208-1241 (1995).
15
Methods of functional extension. (English)
Collegium Logicum. Annals of the Kurt-Gödel-Society. Vol. 1. Wien: Springer-Verlag. 87-122 (1995).
16
The bounds of Skolem functions and their applications. (English)
Inf. Comput. 120, No.1, 149-154 (1995).
17
Equational treatment of first-order logic. (English)
Algebra Univers. 33, No.1, 26-39 (1995).
18
The even more liberalized $δ$-rule in free variable semantic tableaux. (English)
Gottlob, Georg (ed.) et al., Computational logic and proof theory. 3rd Kurt Gödel Colloquium, KGC ’93, Brno, Czech Republic, August 24-27, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 713, 108-119 (1993).
19
Computation with run time Skolemisation (N-Prolog. III). (English)
J. Appl. Non-Class. Log. 3, No.1, 93-128 (1993).
20
Result 1 to 20 of 39 total
Start
Contact
Print
General Help
