One hundred and two problems in mathematical logic

DOI10.2307/2271891zbMATH Open0318.02002OpenAlexW2081160992MaRDI QIDQ4079563FDOQ4079563

Authors: Harvey M. Friedman 

Publication date: 1975

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2271891

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Mathematical logic and foundations (03-XX)

Cites Work

• A model of set-theory in which every set of reals is Lebesgue measurable
• The axiom of determinateness and reduction principles in the analytical hierarchy
• Title not available (Why is that?)
• The α-finite injury method
• Some minimal pairs of α-recursively enumerable degrees
• Iterated Cohen extensions and Souslin's problem
• Internal cohen extensions
• The consistency of classical set theory relative to a set theory with intu1tionistic logic
• On the consistency of a slight (?) modification of Quine's 'New Foundations'
• Distributive Initial Segments of the Degrees of Unsolvability
• Measurable cardinals and \(\Delta^1_3\) well-orderings
• Infinitary analogs of theorems from first order model theory
• Fundamenta Mathematicae: An Examination of Its Founding and Significance
• The elementary theory of recursively enumerable sets
• Beth's theorem in cardinality logics
• Title not available (Why is that?)
• The solution of a decision problem for several classes of rings
• A minimal pair of Π₁⁰ classes
• Minimal α-degrees
• Title not available (Why is that?)

Cited In (82)

• Boolean-valued set theory and forcing
• Inference rules in Nelson's logics, admissibility and weak admissibility
• Remark on Kreisel's conjecture
• Linear temporal logic with until and next, logical consecutions
• Interpretability of various extensions of arithmetic
• On unification and admissible rules in Gabbay-de Jongh logics
• Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
• A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
• On the number of steps in proofs
• Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
• Admissible rules in the implication-negation fragment of intuitionistic logic
• Splitting properties and jump classes
• On maximal intermediate predicate constructive logics
• Admissible and derivable rules in intuitionistic logic
• Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
• Almost structural completeness; an algebraic approach
• Admissible bases via stable canonical rules
• Complexity of admissible rules
• Ranks and pregeometries in finite diagrams
• Proof theory for admissible rules
• On two problems of Harvey Friedman
• Classification theory for non-elementary classes. I: The number of uncountable models of \(\psi \in L_{\omega _ 1,\omega}\)
• Realisability for infinitary intuitionistic set theory
• Proof complexity of non-classical logics
• An explicit basis for admissible inference rules in table modal logics of width 2
• Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable
• Elementary theories of free topo-Boolean and pseudo-Boolean algebras
• Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
• An explicit basis for admissible rules of modal logics of finite width
• Bases of admissible rules of the logics S4 and Int
• Modal logics with several operators and probability interpretations
• Provability interpretations of modal logic
• Logical equations and admissible rules of inference with parameters in modal provability logics
• Example of an \(omega_ 1-\)categorical complete finitely axiomatizable theory
• 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
• Decomposing uncountable squares to countably many chains
• Equations in free topoboolean algebra
• A Basis Theorem for Perfect Sets
• Surrealist landscape with figures (a survey of recent results in set theory)
• Duality Between Logics and Equivalence Relations
• Admissible rules for pretable modal logics
• VARIANTS OF KREISEL’S CONJECTURE ON A NEW NOTION OF PROVABILITY
• Solvability of logical equations in the modal system Grz and intuitionistic logic
• Admissibility and refutation: some characterisations of intermediate logics
• Temporal logic with accessibility temporal relations generated by time states themselves
• Generalizing proofs in monadic languages (with a postscript by Georg Kreisel).
• Refuting Ehrenfeucht conjecture on rigid models
• Turing machine computations in finitely axiomatizable theories
• Admissible inference rules in the linear logic of knowledge and time \(\mathrm{LTK}_r\) with intransitive time relation
• KD is nullary
• The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem
• Multiple conclusion rules in logics with the disjunction property
• The Kreisel length-of-proof problem
• Iterated forcing and changing cofinalities
• Linear temporal logic with non-transitive time, algorithms for decidability and verification of admissibility
• Finite frames fail: how infinity works its way into the semantics of admissibility
• Resplendent models and \({\Sigma_1^1}\)-definability with an oracle
• A note on extensions: admissible rules via semantics
• Complexity of reals in inner models of set theory
• Partitions of topological spaces and a new club-like principle
• A tableau method for checking rule admissibility in S4
• DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
• On a question of Slaman and Groszek
• A new proof of Friedman's conjecture
• Intransitive temporal multi-agent's logic, knowledge and uncertainty, plausibility
• Order types of models of fragments of Peano arithmetic
• In Memoriam: George Stephen Boolos 1940–1996
• Barwise: Abstract Model Theory and Generalized Quantifiers
• Admissible inference rules of modal WCP-logics
• An explicit basis for \textit{WCP}-globally admissible inference rules
• On the ‘definability of definable’ problem of Alfred Tarski, Part II
• Explicit basis for admissible rules in \(K\)-saturated tabular logics
• Description of modal logics which enjoy co-cover property
• Preservation of admissible rules when combining logics
• Admissible rules for six intuitionistic modal logics
• Universal proof theory: feasible admissibility in intuitionistic modal logics
• Globally admissible inference rules
• Anderson and Belnap's invitation to sin
• Basis of globally admissible rules for logic S4
• Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge
• 1997–1998 Winter Meeting of the Association for Symbolic Logic
• There is no bound on Borel classes of graphs in the Luzin–Novikov theorem

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)