-
1
-
-
85028826235
-
Completion of first-order clauses with equality by strict superposition
-
In St. Kaplan and M. Okada, editors, Berlin, Springer-Verlag
-
L. Bachmair and H. Ganzinger. Completion of first-order clauses with equality by strict superposition. In St. Kaplan and M. Okada, editors, Proc. 2nd International Workshop on Conditional and Typed Rewriting, Montreal, LNCS 516, pages 162-180, Berlin, 1991. Springer-Verlag.
-
(1991)
Proc. 2Nd International Workshop on Conditional and Typed Rewriting, Montreal, LNCS 516
, pp. 162-180
-
-
Bachmair, L.1
Ganzinger, H.2
-
2
-
-
0032201822
-
Ordered chaining calculi for first-order theories of transitive relations
-
L. Bachmair and H. Ganzinger. Ordered chaining calculi for first-order theories of transitive relations. Journal of the ACM, 45(6):1007-1049, 1998.
-
(1998)
Journal of the ACM
, vol.45
, Issue.6
, pp. 1007-1049
-
-
Bachmair, L.1
Ganzinger, H.2
-
3
-
-
84976622432
-
Superposition with simplification as a decision procedure for the monadic class with equality
-
G. Gottlob, A. Leitsch, and D. Mundici, editors, Springer Verlag
-
L. Bachmair, H. Ganzinger, and U. Waldmann. Superposition with simplification as a decision procedure for the monadic class with equality. In G. Gottlob, A. Leitsch, and D. Mundici, editors, Computational Logic and Proof Theory, 3rd Kurt Godel Colloquium, LNCS 713, pages 83-96. Springer Verlag, 1993.
-
(1993)
Computational Logic and Proof Theory, 3Rd Kurt Godel Colloquium, LNCS 713
, pp. 83-96
-
-
Bachmair, L.1
Ganzinger, H.2
Waldmann, U.3
-
4
-
-
0040443493
-
Decidability and Boolean Representations
-
American Mathematical Society
-
S. Burris and R. McKenzie. Decidability and Boolean Representations. Memoirs of the AMS, Volume 32, Number 246. American Mathematical Society, 1981.
-
(1981)
Memoirs of the AMS
, vol.32
, Issue.246
-
-
Burris, S.1
McKenzie, R.2
-
10
-
-
0023288215
-
On the computational complexity of algebra of lattices
-
H.B. Hunt, D.J. Rosenkrantz, and P.A. Bloniarz. On the computational complexity of algebra of lattices. SIAM Journal of Computation, 16(1):129-148, 1987.
-
(1987)
SIAM Journal of Computation
, vol.16
, Issue.1
, pp. 129-148
-
-
Hunt, H.B.1
Rosenkrantz, D.J.2
Bloniarz, P.A.3
-
11
-
-
0001521953
-
Boolean algebras with operators, Part I&II
-
1951
-
B. Jonsson and A. Tarski. Boolean algebras with operators, Part I&II. American Journal of Mathematics, 73&74:891-939&127-162, 1951&1952.
-
(1952)
American Journal of Mathematics
, vol.73-74
-
-
Jonsson, B.1
Tarski, A.2
-
12
-
-
0029700012
-
Tarskian set constraints
-
IEEE Computer Society Press
-
D. McAllester, R. Givan, D. Kozen, and C. Witty. Tarskian set constraints. In Proceedings of the Eleventh Annual IEEE Symposium on Logic In Computer Science, pages 138-151. IEEE Computer Society Press, 1996.
-
(1996)
Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science
, pp. 138-151
-
-
McAllester, D.1
Givan, R.2
Kozen, D.3
Witty, C.4
-
13
-
-
0002707123
-
The decision problem for some classes of sentences without quantifiers
-
J.C.C. McKinsey. The decision problem for some classes of sentences without quantifiers. The Journal of Symbolic Logic, 8(3):61-76, 1943.
-
(1943)
The Journal of Symbolic Logic
, vol.8
, Issue.3
, pp. 61-76
-
-
McKinsey, J.C.C.1
-
14
-
-
84896740652
-
Tarskian set constraints are in NEXPTIME
-
Lubos Prim et. al., editor, Springer Verlag
-
P. Mielniczuk and L. Pacholski. Tarskian set constraints are in NEXPTIME. In Lubos Prim et. al., editor, Proceedings of MFCS’98, LNCS 1450, pages 589-596. Springer Verlag, 1998.
-
(1998)
Proceedings of MFCS’98, LNCS 1450
, pp. 589-596
-
-
Mielniczuk, P.1
Pacholski, L.2
-
15
-
-
0001867225
-
Ordered sets and duality for distributive lattices
-
H. Priestley. Ordered sets and duality for distributive lattices. Annals of Discrete Mathematics, 23:39-60, 1984.
-
(1984)
Annals of Discrete Mathematics
, vol.23
, pp. 39-60
-
-
Priestley, H.1
-
16
-
-
84957460274
-
Representation of distributive lattices by means of ordered Stone spaces
-
H.A. Priestley. Representation of distributive lattices by means of ordered Stone spaces. Bull. London Math. Soc., 2:186-190, 1970.
-
(1970)
Bull. London Math. Soc
, vol.2
, pp. 186-190
-
-
Priestley, H.A.1
-
17
-
-
0004070712
-
-
Also in T. Skolem, Select Works in Logic, Scandinavian University Books, Oslo, 1970, pp.103-136
-
T. Skolem. Logisch-kombinatorische Untersuchungen uber die Erfullbarkeit und Beweisbarkeit mathematischen Satze nebst einem Theoreme uber dichte Mengen. Videnskapsselskapets skrifter I, Matematisk-naturvidenskabelig klasse, Videnskab- sakademiet i Kristiania, 4:1-36, 1920. Also in T. Skolem, Select Works in Logic, Scandinavian University Books, Oslo, 1970, pp.103-136.
-
(1920)
Logisch-Kombinatorische Untersuchungen Uber Die Erfullbarkeit Und Beweisbarkeit Mathematischen Satze Nebst Einem Theoreme Uber Dichte Mengen. Videnskapsselskapets Skrifter I, Matematisk-Naturvidenskabelig Klasse, Videnskab- Sakademiet I Kristiania
, vol.4
, pp. 1-36
-
-
Skolem, T.1
-
19
-
-
84957708877
-
Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics I, II
-
To appear
-
V. Sofronie-Stokkermans. Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics I, II. Studia Logica, 1999. To appear.
-
(1999)
Studia Logica
-
-
Sofronie-Stokkermans, V.1
-
21
-
-
0042526717
-
-
PhD thesis, Max-Planck-Institut fur Informatik, Saarbracken
-
G. Struth. Canonical Transformations in Algebra, Universal Algebra, and Logic. PhD thesis, Max-Planck-Institut fur Informatik, Saarbracken, 1998.
-
(1998)
Canonical Transformations in Algebra, Universal Algebra, and Logic
-
-
Struth, G.1
-
22
-
-
0001340960
-
On the complexity of derivation in propositional calculus
-
volume 8, pages 115-125. Consultants Bureau, New York-London, 1970. Reprinted in J. Siekmann and G. Wrightson (eds): Automation of Reasoning
-
G. S. Tseitin. On the complexity of derivation in propositional calculus. In Seminars in Mathematics V.A. Steklov Math. Inst., Leningrad, volume 8, pages 115-125. Consultants Bureau, New York-London, 1970. Reprinted in J. Siekmann and G. Wrightson (eds): Automation of Reasoning, Vol. 2, 1983, Springer, pp.466-486.
-
(1983)
In Seminars in Mathematics V. A. Steklov Math. Inst., Leningrad
, vol.2
, pp. 466-486
-
-
Tseitin, G.S.1
-
23
-
-
84957680292
-
SPASS & FLOTTER Version 0.42
-
M.A. McRobie and J.K. Slaney, editors, Springer Verlag
-
Ch. Weidenbach, B. Gaede, and G. Rock. SPASS & FLOTTER Version 0.42. In M.A. McRobie and J.K. Slaney, editors, Proceedings of CADE-13, LNCS 1104, pages 141-145. Springer Verlag, 1996.
-
(1996)
Proceedings of CADE-13, LNCS 1104
, pp. 141-145
-
-
Weidenbach, C.H.1
Gaede, B.2
Rock, G.3
|