-
2
-
-
0002924587
-
An elementary proof of Chang's completeness theorem for the infinite-valued calculus of Łukasiewicz
-
CIGNOLI, R., and D. MUNDICI, An elementary proof of Chang's completeness theorem for the infinite-valued calculus of Łukasiewicz, Studia Logica 58 (1997), 79-97.
-
(1997)
Studia Logica
, vol.58
, pp. 79-97
-
-
Cignoli, R.1
Mundici, D.2
-
4
-
-
0001601465
-
The relative efficiency of prepositional proof systems
-
COOK, S. A., and A. R. RECKHOW, The relative efficiency of prepositional proof systems, J. Symbolic Logic 44(1) (1979), 36-50.
-
(1979)
J. Symbolic Logic
, vol.44
, Issue.1
, pp. 36-50
-
-
Cook, S.A.1
Reckhow, A.R.2
-
6
-
-
0030304456
-
A complete many-valued logics with product conjunction
-
HÁJEK, P., F. ESTEVA, and L. GODO, A complete many-valued logics with product conjunction, Archive for Mathematics Logic 35 (1996), 191-208.
-
(1996)
Archive for Mathematics Logic
, vol.35
, pp. 191-208
-
-
Hájek, P.1
Esteva, F.2
Godo, L.3
-
7
-
-
0039548261
-
Fuzzy logic and arithmetical hierarchy II
-
HÁJEK, P., Fuzzy logic and arithmetical hierarchy II, Studia Logica 58 (1997), 129-141
-
(1997)
Studia Logica
, vol.58
, pp. 129-141
-
-
Hájek, P.1
-
8
-
-
0003721179
-
Bounded arithmetic, prepositional logic and complexity theory
-
Cambridge University Press, Cambridge - New York - Melbourne
-
KRAJÍČEK, J., Bounded arithmetic, prepositional logic and complexity theory, Encyclopedia of Mathematics and Its Applications 60, Cambridge University Press, Cambridge - New York - Melbourne, 1995.
-
(1995)
Encyclopedia of Mathematics and Its Applications
, vol.60
-
-
Krajíček, J.1
-
9
-
-
0000316125
-
On the structure of semigroups on a compact manifold with boundary
-
MOSTERT, P. S., A. L. SHIELDS, On the structure of semigroups on a compact manifold with boundary, Annals of Math. 65 (1957), 117-143.
-
(1957)
Annals of Math.
, vol.65
, pp. 117-143
-
-
Mostert, P.S.1
Shields, A.L.2
-
10
-
-
0023537271
-
Satisfiability in many-valued sentential logic is NP-complete
-
MUNDICI, D., Satisfiability in many-valued sentential logic is NP-complete, Theor. Computer Sci. 52 (1987), 145-153.
-
(1987)
Theor. Computer Sci.
, vol.52
, pp. 145-153
-
-
Mundici, D.1
-
12
-
-
34250153244
-
Die Unentscheidbarkeit der einstelligen unendlichwertigen Prädikatenlogik
-
RAGAZ, M., Die Unentscheidbarkeit der einstelligen unendlichwertigen Prädikatenlogik, Arch. Math. Logik 23 (1983), 129-139.
-
(1983)
Arch. Math. Logik
, vol.23
, pp. 129-139
-
-
Ragaz, M.1
-
14
-
-
0001072945
-
Die Nichtaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von Łukasiewicz
-
SCARPELLINI, B., Die Nichtaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von Łukasiewicz, J. Symb. Log. 27 (1962), 159-170.
-
(1962)
J. Symb. Log.
, vol.27
, pp. 159-170
-
-
Scarpellini, B.1
-
16
-
-
0000486524
-
Intuitionistic fuzzy logic and intuitionistic fuzzy set theory
-
TAKEUTI, T., S. TITANI, Intuitionistic fuzzy logic and intuitionistic fuzzy set theory, J. Symb. Log, 49 (1984), 851-866.
-
(1984)
J. Symb. Log
, vol.49
, pp. 851-866
-
-
Takeuti, T.1
Titani, S.2
|