scientific article; zbMATH DE number 3236046
From MaRDI portal
Publication:5523665
Cited in
(14)- Rosser provability and the second incompleteness theorem
- Extracting information from resolution proof trees
- A theory of computation based on quantum logic. I
- Mathematics and Symbolic Logics: Some Notes on an Uneasy Relationship
- König's infinity lemma and Beth's tree theorem
- Nonisomorphic atomless Boolean algebras
- Andrzej Mostowski: A Biographical Note
- Andrzej Mostowski and the notion of a model
- Current research on Gödel's incompleteness theorems
- A note on derivability conditions
- Arithmetical completeness theorems for monotonic modal logics
- Emergence, reduction and supervenience: a varied landscape
- Equivalence between an \(\mathcal{L}\)-valued GOA with \(\varepsilon\)-moves and its \(\varepsilon\)-reduction
- On simplicity of formulas
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5523665)
