One hundred and two problems in mathematical logic

DOI10.2307/2271891zbMath0318.02002OpenAlexW2081160992MaRDI QIDQ4079563

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)

Related Items

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, VARIANTS OF KREISEL’S CONJECTURE ON A NEW NOTION OF PROVABILITY, Almost structural completeness; an algebraic approach, Multiple Conclusion Rules in Logics with the Disjunction Property, Intransitive Temporal Multi-agent’s Logic, Knowledge and Uncertainty, Plausibility, Admissible bases via stable canonical rules, On the ‘definability of definable’ problem of Alfred Tarski, Part II, Equations in free topoboolean algebra, A New Proof of Friedman's Conjecture, The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem, Interpretability of various extensions of arithmetic, A Note on Extensions: Admissible Rules via Semantics, The Kreisel length-of-proof problem, Admissible and derivable rules in intuitionistic logic, A Tableau Method for Checking Rule Admissibility in S4, Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge, There is no bound on Borel classes of graphs in the Luzin–Novikov theorem, Unnamed Item, Complexity of admissible rules, On the number of steps in proofs, ORDER TYPES OF MODELS OF FRAGMENTS OF PEANO ARITHMETIC, Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition, 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, KD is nullary, Explicit basis for admissible rules in \(K\)-saturated tabular logics, Description of modal logics which enjoy co-cover property, On two problems of Harvey Friedman, Admissible rules for six intuitionistic modal logics, Globally admissible inference rules, Admissible inference rules of modal WCP-logics, An explicit basis for \textit{WCP}-globally admissible inference rules, An explicit basis for admissible inference rules in table modal logics of width 2, Example of an \(omega_ 1-\)categorical complete finitely axiomatizable theory, Splitting properties and jump classes, Admissible rules in the implication-negation fragment of intuitionistic logic, Iterated forcing and changing cofinalities, Realisability for infinitary intuitionistic set theory, Anderson and Belnap's invitation to sin, Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus, On a question of Slaman and Groszek, Admissible rules for pretable modal logics, 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)., Duality Between Logics and Equivalence Relations, Solvability of logical equations in the modal system Grz and intuitionistic logic, Admissibility and refutation: some characterisations of intermediate logics, Admissible inference rules in the linear logic of knowledge and time \(\mathrm{LTK}_r\) with intransitive time relation, Resplendent models and \({\Sigma_1^1}\)-definability with an oracle, Linear temporal logic with until and next, logical consecutions, Finite frames fail: how infinity works its way into the semantics of admissibility, Remark on Kreisel's conjecture, PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS, Barwise: Abstract Model Theory and Generalized Quantifiers, Modal logics with several operators and probability interpretations, Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable, Provability interpretations of modal logic, Refuting Ehrenfeucht conjecture on rigid models, Boolean-valued set theory and forcing, Decomposing uncountable squares to countably many chains, Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic, Linear Temporal Logic with Non-transitive Time, Algorithms for Decidability and Verification of Admissibility, Proof Complexity of Non-classical Logics, Surrealist landscape with figures (a survey of recent results in set theory), Proof theory for admissible rules, Temporal logic with accessibility temporal relations generated by time states themselves, On maximal intermediate predicate constructive logics, A Basis Theorem for Perfect Sets, 1997–1998 Winter Meeting of the Association for Symbolic Logic, Complexity of reals in inner models of set theory, DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV, In Memoriam: George Stephen Boolos 1940–1996, Ranks and pregeometries in finite diagrams, Turing machine computations in finitely axiomatizable theories, Inference rules in Nelson's logics, admissibility and weak admissibility, 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, Partitions of topological spaces and a new club-like principle

Cites Work