Buchbesprechungen
- 作者W. Pribilla; K. Demmler; V. Diehl; H. Martin; P. Joller; H. Schubothe; K. Betke; A. Ganzoni
- 卷第31卷
- 期第5期
- 印刷ISSN0939-5555
- 电子ISSN1432-0584
- 文件大小384.44KB
- 发表时间1975-11
- DOI10.1007/bf01634150
- 页码325-329
Recursive coloration of countable graphsHans-Georg Carstens; Peter Päppinghaus · 1983
On the logic of UNITYPeter Päppinghaus · 1995
Rekursion über Dilatoren und die Bachmann-HierarchiePeter Päppinghaus · Archive for Mathematical Logic · 1989
Nondeterministic three-valued logic: Isotonic and guarded truth-functionsPeter Päppinghaus; Martin Wirsing · Studia Logica · 1983
A version of the ∑1-reflection principle for CFA provable in PRAPeter Päppinghaus · Archive for Mathematical Logic · 1980
Nondeterministic Three-Valued Logic: Isotonic and Guarded Truth-FunctionsPeter Päppinghaus and Martin Wirsing · Studia Logica: An International Journal for Symbolic Logic · 1983
A result on implications of Σ 1-sentences and its application to normal form theoremsGirard, Jean-Yves; Päppinghaus, Peter · The Journal of Symbolic Logic · 1981
Homology of proof-netsFrançois Métayer · Archive for Mathematical Logic · 1994
Countable models of 1-based theoriesAnand Pillay · Archive for Mathematical Logic · 1992
Intuitionistic typical ambiguityDaniel Dzierzgowski · Archive for Mathematical Logic · 1992
Onκ-complete reduced productsTapani Hyttinen · Archive for Mathematical Logic · 1992
The monadic theory of (ω2,Shmuel Lifsches; Saharon Shelah · Archive for Mathematical Logic · 1992
Strong counterexamples to Borel hyperdeterminacyC. Ward Henson · Archive for Mathematical Logic · 1992
Subsets of models of arithmeticRoman Kossak; Jeffrey B. Paris · Archive for Mathematical Logic · 1992
Constructibility in higher order arithmeticsA. Sochor · Archive for Mathematical Logic · 1993