Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
From MaRDI portal
Publication:2232317
DOI10.4171/OWR/2020/34zbMath1473.00044MaRDI QIDQ2232317
No author found.
Publication date: 5 October 2021
Published in: Oberwolfach Reports (Search for Journal in Brave)
Proceedings of conferences of miscellaneous specific interest (00B25) Collections of abstracts of lectures (00B05) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Proof theory and constructive mathematics (03Fxx)
Cites Work
- The complexity of computing the permanent
- Total curvature and simple pursuit on domains of curvature bounded above
- On quantitative versions of theorems due to F. E. Browder and R. Wittmann
- A recursion-theoretic approach to NP
- Proof analysis in intermediate logics
- Proof-theoretical analysis of order relations
- Effective metastability of Halpern iterates in \(CAT(0)\) spaces
- The \(\Sigma_1\)-provability logic of \(\mathsf{HA}\)
- Proof-theoretic analysis of KPM
- A certified, corecursive implementation of exact real numbers
- Moudafi's viscosity approximations with Meir--Keeler contractions
- A curious nucleus
- Injecting uniformities into Peano arithmetic
- Realizability. An introduction to its categorical side
- Proof theory for admissible rules
- A minimalist two-level foundation for constructive mathematics
- Some observations on the connection between counting and recursion
- Algebras and combinators
- Fixed point iterations for real functions
- Constructivism in mathematics. An introduction. Volume II
- A new recursion-theoretic characterization of the polytime functions
- A course in constructive algebra
- On Krull's separation lemma
- Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM
- Recursion theoretic characterizations of complexity classes of counting functions
- Krull dimension, Nullstellensätze and dynamical evaluation
- Extending Martin-Löf type theory by one Mahlo-universe
- Real number computation through Gray code embedding.
- On the uniform computational content of computability theory
- Provability logic and the completeness principle
- Consistency of the intensional level of the minimalist foundation with Church's thesis and axiom of choice
- Prime ideal theory for general algebras
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- An abstract data type for real numbers
- Viscosity approximation methods for fixed-points problems
- Best solving modal equations
- Dynamic evaluation of integrity and the computational content of Krull's lemma
- Sequent calculi for intuitionistic Gödel-Löb logic
- Implicit recursion-theoretic characterizations of counting classes
- The computational significance of Hausdorff's maximal chain principle
- Valuative dimension and monomial orders
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- ``Lion-man and the fixed point property
- Moduli of regularity and rates of convergence for Fejér monotone sequences
- On the removal of weak compactness arguments in proof mining
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\)
- Commutative algebra: constructive methods. Finite projective modules. Translated from the French by Tania K. Roblot
- Constructive commutative algebra. Projective modules over polynomial rings and dynamical Gröbner bases
- Making the use of maximal ideals constructive
- Is there a ``Hilbert thesis?
- Die Erweiterung halbgeordneter Gruppen zu Verbandsgruppen
- Undecidable theories
- A uniform betweenness property in metric spaces and its role in the quantitative analysis of the ``lion-man game
- On the admissible rules of intuitionistic propositional logic
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
- Division in logspace-uniformNC1
- Neighborhood Semantics for Basic and Intuitionistic Logic
- On Choice Rules in Dependent Type Theory
- Proofs and Computations
- Tripos theory in retrospect
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- Local stability of ergodic averages
- A logical approach to abstract algebra
- Characterizing PSPACE with pointers
- Dimension de Heitmann des treillis distributifs et des anneaux commutatifs
- A subgradient-type method for the equilibrium problem over the fixed point set and its applications
- From Coinductive Proofs to Exact Real Arithmetic
- A quantitative mean ergodic theorem for uniformly convex Banach spaces
- Log Depth Circuits for Division and Related Problems
- Tripos theory
- Model-theoretic properties characterizing Peano arithmetic
- A Note on Zariski's Lemma
- On the Convergence of Some Iteration Processes in Uniformly Convex Banach Spaces
- Infinitary intuitionistic logic from a classical point of view
- On Extensions of Models of Strong Fragments of Arithmetic
- Unification in intuitionistic logic
- Quantitative results on Fejér monotone sequences
- UNSOUND INFERENCES MAKE PROOFS SHORTER
- Proof Complexity
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- Nontrivial Uses of Trivial Rings
- Iterative Algorithms for Equilibrium Problems
- Tauberian Theory
- The Recursively Mahlo Property in Second Order Arithmetic
- BOUNDS FOR INDEXES OF NILPOTENCY IN COMMUTATIVE RING THEORY: A PROOF MINING APPROACH
- Geometric Rules in Infinitary Logic
- PROOF-THEORETIC METHODS IN NONLINEAR ANALYSIS
- The finitary content of sunny nonexpansive retractions
- Implicative algebras: a new foundation for realizability and forcing
- Resolving finite indeterminacy
- Logic for Gray-code Computation
- Remarks on Barr’s Theorem: Proofs in Geometric Theories
- Constructive Modalities with Provability Smack
- On maximum conservative extensions
- Theories for TC0 and Other Small Complexity Classes
- Goodstein’s Theorem Revisited
- ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION
- Krivine's classical realisability from a categorical perspective
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Fixed points of nonexpanding maps
- Admissible Rules of Modal Logics
- Program extraction in exact real arithmetic
- An Ergodic Theorem for n-Parameter Groups
- A note on the Borel-Cantelli lemma
- Dynamical method in algebra: Effective Nullstellensätze
- Extending the system T\(_0\) of explicit mathematics: The limit and Mahlo axioms
- A note on the finitization of Abelian and Tauberian theorems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
