One hundred and two problems in mathematical logic
From MaRDI portal
Cites work
- A minimal pair of Π10 classes
- A model of set-theory in which every set of reals is Lebesgue measurable
- Beth's theorem in cardinality logics
- Distributive Initial Segments of the Degrees of Unsolvability
- Fundamenta Mathematicae: An Examination of Its Founding and Significance
- scientific article; zbMATH DE number 3289430 (Why is no real title available?)
- scientific article; zbMATH DE number 3356762 (Why is no real title available?)
- scientific article; zbMATH DE number 3027246 (Why is no real title available?)
- Infinitary analogs of theorems from first order model theory
- Internal cohen extensions
- Iterated Cohen extensions and Souslin's problem
- Measurable cardinals and \(\Delta^1_3\) well-orderings
- Minimal α-degrees
- On the consistency of a slight (?) modification of Quine's 'New Foundations'
- Some minimal pairs of α-recursively enumerable degrees
- The axiom of determinateness and reduction principles in the analytical hierarchy
- The consistency of classical set theory relative to a set theory with intu1tionistic logic
- The elementary theory of recursively enumerable sets
- The solution of a decision problem for several classes of rings
- The α-finite injury method
Cited in
(88)- Proof theory for admissible rules
- Turing machine computations in finitely axiomatizable theories
- Elementary theories of free topo-Boolean and pseudo-Boolean algebras
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- Bases of admissible rules of the logics S4 and Int
- Equations in free topoboolean algebra
- Interpretability of various extensions of arithmetic
- On the number of steps in proofs
- On two problems of Harvey Friedman
- Example of an \(omega_ 1-\)categorical complete finitely axiomatizable theory
- Splitting properties and jump classes
- Iterated forcing and changing cofinalities
- Admissible rules for pretable modal logics
- Solvability of logical equations in the modal system Grz and intuitionistic logic
- Provability interpretations of modal logic
- Refuting Ehrenfeucht conjecture on rigid models
- Boolean-valued set theory and forcing
- Decomposing uncountable squares to countably many chains
- Complexity of reals in inner models of set theory
- The Kreisel length-of-proof problem
- Ranks and pregeometries in finite diagrams
- Anderson and Belnap's invitation to sin
- Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable
- Inference rules in Nelson's logics, admissibility and weak admissibility
- On maximal intermediate predicate constructive logics
- Description of modal logics which enjoy co-cover property
- Admissible rules for six intuitionistic modal logics
- Globally admissible inference rules
- Realisability for infinitary intuitionistic set theory
- Almost structural completeness; an algebraic approach
- Admissible bases via stable canonical rules
- In Memoriam: George Stephen Boolos 1940–1996
- A new proof of Friedman's conjecture
- A tableau method for checking rule admissibility in S4
- A note on extensions: admissible rules via semantics
- On a question of Slaman and Groszek
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
- On unification and admissible rules in Gabbay-de Jongh logics
- Duality Between Logics and Equivalence Relations
- A Basis Theorem for Perfect Sets
- 1997–1998 Winter Meeting of the Association for Symbolic Logic
- Admissible and derivable rules in intuitionistic logic
- An explicit basis for admissible inference rules in table modal logics of width 2
- KD is nullary
- Barwise: Abstract Model Theory and Generalized Quantifiers
- Admissibility and refutation: some characterisations of intermediate logics
- An explicit basis for admissible rules of modal logics of finite width
- Admissible inference rules in the linear logic of knowledge and time \(\mathrm{LTK}_r\) with intransitive time relation
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
- VARIANTS OF KREISEL’S CONJECTURE ON A NEW NOTION OF PROVABILITY
- On the ‘definability of definable’ problem of Alfred Tarski, Part II
- Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge
- There is no bound on Borel classes of graphs in the Luzin–Novikov theorem
- Order types of models of fragments of Peano arithmetic
- Finite frames fail: how infinity works its way into the semantics of admissibility
- Linear temporal logic with non-transitive time, algorithms for decidability and verification of admissibility
- Multiple conclusion rules in logics with the disjunction property
- Intransitive temporal multi-agent's logic, knowledge and uncertainty, plausibility
- Preservation of admissible rules when combining logics
- Modal logics with several operators and probability interpretations
- Partitions of topological spaces and a new club-like principle
- Proof complexity of non-classical logics
- Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
- Explicit basis for admissible rules in K-saturated tabular logics
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
- Admissible inference rules of modal WCP-logics
- An explicit basis for \textit{WCP}-globally admissible inference rules
- Admissible rules in the implication-negation fragment of intuitionistic logic
- Universal proof theory: feasible admissibility in intuitionistic modal logics
- Basis of globally admissible rules for logic S4
- A _2⁰ singleton of minimal arithmetic degree
- Remark on Kreisel's conjecture
- Decidability of global admissibility of inference rules in logic S4
- Logics of logics
- The logic of logical necessity
- Introduction
- Building models in small cardinals in local abstract elementary classes
- Surrealist landscape with figures (a survey of recent results in set theory)
- Temporal logic with accessibility temporal relations generated by time states themselves
- Classification theory for non-elementary classes. I: The number of uncountable models of \(\psi \in L_{\omega _ 1,\omega}\)
- Logical equations and admissible rules of inference with parameters in modal provability logics
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem
- Complexity of admissible rules
- Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
- Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms
- Generalizing proofs in monadic languages (with a postscript by Georg Kreisel).
- Resplendent models and \({\Sigma_1^1}\)-definability with an oracle
- Linear temporal logic with until and next, logical consecutions
This page was built for publication: One hundred and two problems in mathematical logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4079563)
