Peter Schuster

Comput., 2024

A General Constructive Form of Higman's Lemma.

[BibT_eX]

[DOI]

Stefano Berardi

Gabriele Buriola

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

Radical theory of Scott-open filters.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2023

A Constructive Picture of Noetherian Conditions and Well Quasi-orders.

[BibT_eX]

[DOI]

Gabriele Buriola

Ingo Blechschmidt

Proceedings of the Unity of Logic and Computation, 2023

2022

A universal algorithm for Krull's theorem.

[BibT_eX]

[DOI]

Thomas Powell

Franziskus Wiesnet

Inf. Comput., 2022

The Jacobson radical for an inconsistency predicate.

[BibT_eX]

[DOI]

Comput., 2022

The Jacobson radical of a Propositional Theory.

[BibT_eX]

[DOI]

Giulio Fellin

Bull. Symb. Log., 2022

Maximal Ideals in Countable Rings, Constructively.

[BibT_eX]

[DOI]

Ingo Blechschmidt

Proceedings of the Revolutions and Revelations in Computability, 2022

2021

Geometric Logic, Constructivisation, and Automated Theorem Proving (Dagstuhl Seminar 21472).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2021

A General Glivenko-Gödel Theorem for Nuclei.

[BibT_eX]

[DOI]

Giulio Fellin

Proceedings of the Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, 2021

2020

On Scott's semantics for many-valued logic.

[BibT_eX]

[DOI]

Satoru Niki

J. Log. Comput., 2020

Resolving finite indeterminacy: A definitive constructive universal prime ideal theorem.

[BibT_eX]

[DOI]

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

The Computational Significance of Hausdorff's Maximal Chain Principle.

[BibT_eX]

[DOI]

Proceedings of the Beyond the Horizon of Computability, 2020

Modal Logic for Induction.

[BibT_eX]

[DOI]

Giulio Fellin

Sara Negri

Proceedings of the 13th Conference on Advances in Modal Logic, 2020

2019

Some forms of excluded middle for linear orders.

[BibT_eX]

[DOI]

Math. Log. Q., 2019

Preface for the special issue of Proof, Structure, and Computation 2014.

[BibT_eX]

[DOI]

Dirk Pattinson

Ana Sokolova

J. Log. Comput., 2019

An Algorithmic Approach to the Existence of Ideal Objects in Commutative Algebra.

[BibT_eX]

[DOI]

Thomas Powell

Franziskus Wiesnet

Proceedings of the Logic, Language, Information, and Computation, 2019

2018

A General Extension Theorem for Directed-Complete Partial Orders.

[BibT_eX]

[DOI]

Reports Math. Log., 2018

Suzumura Consistency, an Alternative Approach.

[BibT_eX]

[DOI]

FLAP, 2018

2017

Eliminating Disjunctions by Disjunction Elimination.

[BibT_eX]

[DOI]

Davide Rinaldi

Bull. Symb. Log., 2017

2016

Editorial.

[BibT_eX]

[DOI]

Hannes Leitgeb

Iosif Petrakis

Helmut Schwichtenberg

FLAP, 2016

Preface.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2016

2014

Constructing Gröbner bases for Noetherian rings.

[BibT_eX]

[DOI]

Hervé Perdry

Math. Struct. Comput. Sci., 2014

Approximating Beppo Levi's principio di Approssimazione.

[BibT_eX]

[DOI]

Riccardo Bruni

Bull. Symb. Log., 2014

2013

Are There Enough Injective Sets?

[BibT_eX]

[DOI]

Peter Aczel

Benno van den Berg

Johan Georg Granström

Stud Logica, 2013

A generalized cut characterization of the fullness axiom in CZF.

[BibT_eX]

[DOI]

Laura Crosilla

Erik Palmgren

Log. J. IGPL, 2013

Induction in Algebra: a First Case Study.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

2012

The Weak Koenig Lemma, Brouwer's Fan Theorem, De Morgan's Law, and Dependent Choice.

[BibT_eX]

[DOI]

Josef Berger

Reports Math. Log., 2012

The Kripke schema in metric topology.

[BibT_eX]

[DOI]

Robert S. Lubarsky

Fred Richman

Math. Log. Q., 2012

A predicative completion of a uniform space.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2012

Preface.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2012

A Direct Proof of Wiener's Theorem.

[BibT_eX]

[DOI]

Matthew Hendtlass

Proceedings of the How the World Computes, 2012

2011

Noetherian orders.

[BibT_eX]

[DOI]

Hervé Perdry

Math. Struct. Comput. Sci., 2011

Uniqueness, continuity and the existence of implicit functions in constructive analysis.

[BibT_eX]

[DOI]

Hannes Diener

LMS J. Comput. Math., 2011

Minima and best approximations in constructive analysis.

[BibT_eX]

[DOI]

Matthew Hendtlass

J. Log. Anal., 2011

Unique paths as formal points.

[BibT_eX]

[DOI]

Thierry Coquand

J. Log. Anal., 2011

On the contrapositive of countable choice.

[BibT_eX]

[DOI]

Arch. Math. Log., 2011

2010

On Choice Principles and Fan Theorems.

[BibT_eX]

[DOI]

Hannes Diener

J. Univers. Comput. Sci., 2010

Problems, solutions, and completions.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2010

2009

Spectral schemes as ringed lattices.

[BibT_eX]

[DOI]

Thierry Coquand

Henri Lombardi

Ann. Math. Artif. Intell., 2009

2008

The Zariski spectrum as a formal geometry.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Apartness, compactness and nearness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Editorial: Math. Log. Quart. 1/2008.

[BibT_eX]

[DOI]

Math. Log. Q., 2008

A continuity principle, a version of Baire's theorem and a boundedness principle.

[BibT_eX]

[DOI]

J. Symb. Log., 2008

2007

Corrigendum to "Unique solutions".

[BibT_eX]

[DOI]

Math. Log. Q., 2007

Problems as Solutions.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

2006

Binary Refinement Implies Discrete Exponentiation.

[BibT_eX]

[DOI]

Stud Logica, 2006

Classifying Dini's Theorem.

[BibT_eX]

[DOI]

Josef Berger

Notre Dame J. Formal Log., 2006

Unique solutions.

[BibT_eX]

[DOI]

Math. Log. Q., 2006

The fan theorem and unique existence of maxima.

[BibT_eX]

[DOI]

Josef Berger

J. Symb. Log., 2006

Ideals in constructive Banach algebra theory.

[BibT_eX]

[DOI]

Robin Havea

J. Complex., 2006

Formal Zariski topology: Positivity and points.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2006

Quasi-apartness and neighbourhood spaces.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2006

Do Noetherian Modules Have Noetherian Basis Functions?.

[BibT_eX]

[DOI]

Júlia Zappe

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

What is Continuity, Constructively?

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2005

On constructing completions.

[BibT_eX]

[DOI]

Laura Crosilla

J. Symb. Log., 2005

Strong continuity implies uniform sequential continuity.

[BibT_eX]

[DOI]

Arch. Math. Log., 2005

A Nilregular Element Property.

[BibT_eX]

[DOI]

Thierry Coquand

Henri Lombardi

Proceedings of the Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005

Compactness in apartness spaces?

[BibT_eX]

[DOI]

Proceedings of the Spatial Representation: Discrete vs. Continuous Computational Models, 2005

2004

Compactness under constructive scrutiny.

[BibT_eX]

[DOI]

Math. Log. Q., 2004

2003

Unique existence, approximate solutions, and countable choice.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

Apartness, Topology, and Uniformity: a Constructive View.

[BibT_eX]

[DOI]

Luminita Vîta

Math. Log. Q., 2002

Compactness and Continuity, Constructively Revisited.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Apartness as a Relation Between Subsets.

[BibT_eX]

[DOI]

Luminita Vîta

Proceedings of the Combinatorics, 2001

2000

A Constructive Look at Generalised Cauchy Reals.

[BibT_eX]

[DOI]

Math. Log. Q., 2000

Elementary Choiceless Constructive Analysis.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 2000

1999

Linear Independence without Choice.

[BibT_eX]

[DOI]

Fred Richman