Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
From MaRDI portal
Publication:1731963
DOI10.4171/OWR/2017/53zbMath1409.00077OpenAlexW4230543667WikidataQ128724227 ScholiaQ128724227MaRDI QIDQ1731963
No author found.
Publication date: 15 March 2019
Published in: Oberwolfach Reports (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/owr/2017/53
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)
Uses Software
Cites Work
- Dynamical method in algebra: Effective Nullstellensätze
- Proof theory in the abstract
- 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
- A universal Krull-Lindenbaum theorem
- Revisiting Zariski main theorem from a constructive point of view
- Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal
- Goodstein sequences for prominent ordinals up to the ordinal of \(\Pi^1_1\)-\(\mathrm{CA}_0\)
- Proof lengths for instances of the Paris-Harrington principle
- Constructive finite free resolutions
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation
- Results on the propositional \(\mu\)-calculus
- Proof analysis in modal logic
- Cobham recursive set functions
- Canonical completeness of infinitary \(\mu \)
- Realizability. An introduction to its categorical side
- Syntactic cut-elimination for common knowledge
- Proving open properties by induction
- Rapidly growing Ramsey functions
- A globalization of the Hahn-Banach theorem
- Constructivism in mathematics. An introduction. Volume II
- A course in constructive algebra
- Lebesgue numbers and Atsuji spaces in subsystems of second-order arithmetic
- Real number computation through Gray code embedding.
- Syntactic forcing models for coherent logic
- Dependent choice, `quote' and the clock
- Slow consistency
- An abstract data type for real numbers
- The Frobenius condition, right properness, and uniform fibrations
- The strength of infinitary Ramseyan principles can be accessed by their densities
- Slow reflection
- An application of proof mining to nonlinear iterations
- Making the use of maximal ideals constructive
- Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
- GEOMETRISATION OF FIRST-ORDER LOGIC
- PROOF ANALYSIS FOR LEWIS COUNTERFACTUALS
- Theories, Sites, Toposes
- Realizability algebras II : new models of ZF + DC
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
- Extracting Imperative Programs from Proofs: In-place Quicksort
- Existential witness extraction in classical realizability and via a negative translation
- Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras
- Sequential games and optimal strategies
- Weak Sharp Minima in Mathematical Programming
- Realizability algebras: a program to well order R
- A logical approach to abstract algebra
- A Sequent Calculus for Preferential Conditional Logic Based on Neighbourhood Semantics
- Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
- Selection functions, bar recursion and backward induction
- Accessible Independence Results for Peano Arithmetic
- Cut Elimination in the Presence of Axioms
- Non-monotonic Pre-fix Points and Learning
- Some observations on the logical foundations of inductive theorem proving
- Hidden constructions in abstract algebra. Krull Dimension of distributive lattices and commutative rings
- Weihrauch Complexity in Computable Analysis
- COBHAM RECURSIVE SET FUNCTIONS AND WEAK SET THEORIES
- ACKERMANNIAN GOODSTEIN PRINCIPLES FOR FIRST ORDER PEANO ARITHMETIC
- COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
- Modalities in homotopy type theory
- Logic for Gray-code Computation
- Connected choice and the Brouwer fixed point theorem
- An analysis of the Podelski–Rybalchenko termination theorem via bar recursion
- Classifying Phase Transition Thresholds for Goodstein Sequences and Hydra Games
- ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION
- Generic cuts in models of arithmetic
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Rippling: Meta-Level Guidance for Mathematical Reasoning
- The generalised type-theoretic interpretation of constructive set theory
- Transfinite ordinals in recursive number theory
- On the restricted ordinal theorem
- Convex analysis and monotone operator theory in Hilbert spaces
- Rudiments of \(\mu\)-calculus
- Typed lambda-calculus in classical Zermelo-Fraenkel set theory
This page was built for publication: Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
