## Found 3,019 Documents (Results 1–100)

100
MathJax

Full Text:

### The Jacobson radical of a propositional theory. (English)Zbl 07550752

MSC:  03F03 03F65
Full Text:

### Semilinear logics with knotted axioms. (English)Zbl 07547163

MSC:  03Bxx 03Gxx 03Fxx
Full Text:

### Logic and verification of product configuration in the automotive industry. (English)Zbl 07543891

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 387-408 (2022).
Full Text:

### The Braga method: extracting certified algorithms from complex recursive schemes in Coq. (English)Zbl 07543890

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 305-386 (2022).
Full Text:

### An Ad-Hoc semantics to study structural properties of types. (English)Zbl 07543889

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 267-303 (2022).
Full Text:

### Formal topology and univalent foundations. (English)Zbl 07543888

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 255-266 (2022).
Full Text:

### A uniform characterization of $$\Sigma_1$$-reflection over the fragments of Peano arithmetic. (English)Zbl 07543887

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 189-253 (2022).
Full Text:

### Generalized spaces for constructive algebra. (English)Zbl 07543886

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 99-187 (2022).
Full Text:

### From intuitionistic mathematics to point-free topology. (English)Zbl 07543885

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 55-98 (2022).
Full Text:

### Conceptions of proof from aristotle to Gentzen’s calculi. (English)Zbl 07543884

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 33-54 (2022).
Full Text:

### Proof and computation: perspectives for mathematics, computer science, and philosophy. (English)Zbl 07543883

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 1-32 (2022).
Full Text:

Full Text:

Full Text:

MSC:  03Fxx
Full Text:

### Uniquely orderable interval graphs. (English)Zbl 07541375

MSC:  03Fxx 03Bxx 05Cxx
Full Text:

### Proof nets for the Lambek calculus with one division and a negative-polarity modality for weakening. (English. Russian original)Zbl 07538686

J. Math. Sci., New York 262, No. 5, 759-766 (2022); translation from Fundam. Prikl. Mat. 23, No. 2, 247-257 (2020).
MSC:  03Bxx 03Fxx 68Qxx
Full Text:

### The Jacobson radical for an inconsistency predicate. (English)Zbl 07527242

MSC:  13-XX 03Dxx 03Fxx
Full Text:

Full Text:

Full Text:

Full Text:

### Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability. (English. Russian original)Zbl 07488500

Math. Notes 111, No. 2, 243-257 (2022); translation from Mat. Zametki 111, No. 2, 241-257 (2022).
MSC:  03Fxx 03Bxx 03Cxx
Full Text:

### Not all Kripke models of $$\mathsf{HA}$$ are locally $$\mathsf{PA}$$. (English)Zbl 07472316

MSC:  03Fxx 03Cxx 03Bxx
Full Text:

### On Farkas’ lemma and related propositions in BISH. (English)Zbl 1486.03113

MSC:  03F60 46N10
Full Text:

### Dynamic evaluation of integrity and the computational content of Krull’s lemma. (English)Zbl 07389899

MSC:  13A18 03F65 16P60
Full Text:

### Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. (English)Zbl 1486.03009

Hackensack, NJ: World Scientific (ISBN 978-981-12-3647-1/hbk; 978-981-12-3649-5/ebook). xvi, 408 p. (2022).
Full Text:

Full Text:

### UP-algebra with apartness. (English)Zbl 07539998

MSC:  03F65 03G25
Full Text:

### An algorithmic version of Zariski’s lemma. (English)Zbl 07495193

De Mol, Liesbeth (ed.) et al., Connecting with computability. 17th conference on computability in Europe, CiE 2021, virtual event, Ghent, Belgium, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12813, 469-482 (2021).
MSC:  14A25 03F65 12F05
Full Text:

MSC:  03-06
Full Text:

Full Text:

Full Text:

Full Text:

### Advances in mathematical logic. Dedicated to the memory of Professor Gaisi Takeuti, SAML 2018. Selected, revised contributions based on the presentations at the symposium, Kobe, Japan, September 18–20, 2018. (English)Zbl 1479.03003

Springer Proceedings in Mathematics & Statistics 369. Singapore: Springer (ISBN 978-981-16-4172-5/hbk; 978-981-16-4173-2/ebook). xi, 229 p. (2021).
Full Text:

### A note on connected reduced rings. (English)Zbl 1481.13016

MSC:  13B25 03F65
Full Text:

Full Text:

MSC:  03F99
Full Text:

### Connecting sequent calculi with Lorenzen-style dialogue games. (English)Zbl 07465330

Heinzmann, Gerhard (ed.) et al., Paul Lorenzen – mathematician and logician. Contributions presented at the workshop, Konstanz, Germany, March 8–9, 2018. Cham: Springer. Log. Epistemol. Unity Sci. 51, 115-141 (2021).
Full Text:

### Syntax for semantics: Krull’s maximal ideal theorem. (English)Zbl 07465328

Heinzmann, Gerhard (ed.) et al., Paul Lorenzen – mathematician and logician. Contributions presented at the workshop, Konstanz, Germany, March 8–9, 2018. Cham: Springer. Log. Epistemol. Unity Sci. 51, 77-102 (2021).
Full Text:

### Lorenzen and constructive mathematics. (English)Zbl 07465326

Heinzmann, Gerhard (ed.) et al., Paul Lorenzen – mathematician and logician. Contributions presented at the workshop, Konstanz, Germany, March 8–9, 2018. Cham: Springer. Log. Epistemol. Unity Sci. 51, 47-61 (2021).
Full Text:

Full Text:

Full Text:

### On a strengthening of the non-isomorphism theorem for provability algebras. (English. Russian original)Zbl 07427861

Dokl. Math. 104, No. 1, 180-183 (2021); translation from Dokl. Ross. Akad. Nauk, Mat. Inform. Protsessy Upr. 499, 26-30 (2021).
MSC:  03Fxx 03Bxx 03Gxx
Full Text:

### Extensional constructive real analysis via locators. (English)Zbl 07408496

MSC:  03B38 03F60
Full Text:

Full Text:

### A semilattice of degrees of computable metrics. (English. Russian original)Zbl 07401177

Sib. Math. J. 62, No. 5, 822-841 (2021); translation from Sib. Mat. Zh. 62, No. 5, 1013-1038 (2021).
MSC:  03Dxx 03Fxx 68Qxx
Full Text:

### An example of noncomputability of exponents of a system of ordinary differential equations. (English. Russian original)Zbl 07392395

Mosc. Univ. Math. Bull. 76, No. 2, 53-59 (2021); translation from Vestn. Mosk. Univ., Ser. I 76, No. 2, 10-15 (2021).
MSC:  03Dxx 03-XX 03Fxx
Full Text:

### Structural weakening and paradoxes. (English)Zbl 07391981

MSC:  03B47 03B80 03F99
Full Text:

### The complexity of module radicals. (English)Zbl 07391980

MSC:  03D80 03F65
Full Text:

### On nonmonotonic consequence relations. (English)Zbl 07380930

MSC:  03B05 03B99 03F99
Full Text:

### On tseitin formulas, read-once branching programs and treewidth. (English)Zbl 07377746

MSC:  68Qxx 03Fxx 68Txx
Full Text:

### Dense computability structures. (English)Zbl 07371884

MSC:  03Fxx 68Qxx 03Dxx
Full Text:

MSC:  03Dxx
Full Text:

### Direct spectra of Bishop spaces and their limits. (English)Zbl 1473.03038

MSC:  03F65 03F60
Full Text:

### Foundations of constructive probability theory. (English)Zbl 07344237

Encyclopedia of Mathematics and its Applications 177. Cambridge: Cambridge University Press (ISBN 978-1-108-83543-5/hbk; 978-1-108-88401-3/ebook). xiii, 612 p. (2021).
Full Text:

Full Text:

### Undecidability, uncomputability, and unpredictability. (English)Zbl 1469.81002

The Frontiers Collection. Cham: Springer (ISBN 978-3-030-70353-0/hbk; 978-3-030-70354-7/ebook). vii, 180 p. (2021).
Full Text:

Full Text:

### Proof and the art of mathematics. Examples and extensions. (English)Zbl 07330885

Cambridge, MA: MIT Press (ISBN 978-0-262-54220-3/pbk). 132 p. (2021).
MSC:  03-01 03Fxx 01A80

### Constructive domains with classical witnesses. (English)Zbl 07327952

MSC:  03B70 68-XX
Full Text:

### On descriptional propositions in Ibn Sīnā: elements for a logical analysis. (English)Zbl 1473.03007

Mojtahedi, Mojtaba (ed.) et al., Mathematics, logic, and their philosophies. Essays in honour of Mohammad Ardeshir. Cham: Springer. Log. Epistemol. Unity Sci. 49, 411-431 (2021).
Full Text:

### Intuitionistic/constructive accounts of the continuum today. (English)Zbl 1467.03032

Shapiro, Stewart (ed.) et al., The history of continua. Philosophical and mathematical perspectives. Oxford: Oxford University Press. 476-501 (2021).
Full Text:

Full Text:

### Characterising Brouwer’s continuity by bar recursion on moduli of continuity. (English)Zbl 07297808

Reviewer: Danko Ilik (Paris)
Full Text:

### Challenging problems in Euclidean geometry. (English)Zbl 1475.97018

MSC:  97G40 51M04
Full Text:

### An indeterminate universe of sets. (English)Zbl 1475.03046

MSC:  03A05 03F50 03E70
Full Text:

Full Text:

### Isomorphism theorems for basic constructive algebraic structures with special emphasize on constructive semigroups with apartness – an overview. (English)Zbl 07392809

Silvestrov, Sergei (ed.) et al., Algebraic structures and applications. Selected papers based on the presentations at the international conference on stochastic processes and algebraic structures – from theory towards applications, SPAS 2017, Västerås and Stockholm, Sweden, October 4–6, 2017. Cham: Springer. Springer Proc. Math. Stat. 317, 653-686 (2020).
MSC:  20M15 03F65
Full Text:

### The constructive Hahn-Banach theorem, revisited. (English)Zbl 07377989

Rezuş, Adrian (ed.), Contemporary logic and computing. London: College Publications. Landsc. Log. 1, 638-663 (2020).
MSC:  03Bxx 03Dxx

### Implicative semigroups with apartness, a review. (English)Zbl 1474.03151

MSC:  03F65 20M12 06F05

### A new co-filter in implicative semigroups with apartness. (English)Zbl 1474.03150

MSC:  03F65 20M12 06F05
Full Text:

### A remark on co-ideals in implicative semigroups with apartness. (English)Zbl 1474.03149

MSC:  03F65 20M12 06F05
Full Text:

Full Text:

MSC:  68-XX
Full Text:

Full Text:

### Lifschitz realizability as a topological construction. (English)Zbl 1485.03222

MSC:  03E70 03F50 03F65
Full Text:

Full Text:

Full Text:

MSC:  03F60
Full Text:

Full Text:

### A constructive framework for teaching discrete mathematics. (English)Zbl 07285502

Kosheleva, Olga (ed.) et al., Beyond traditional probabilistic data processing techniques: interval, fuzzy etc. methods and their applications. Dedicated to Vladik Kreinovich on the occasion of his 65th birthday. Cham: Springer. Stud. Comput. Intell. 835, 21-46 (2020).
MSC:  68T37
Full Text:

### Gödel’s theorems and Zermelo’s axioms. A firm foundation of mathematics. (English)Zbl 07281928

Cham: Birkhäuser (ISBN 978-3-030-52278-0/hbk; 978-3-030-52281-0/pbk; 978-3-030-52279-7/ebook). x, 236 p. (2020).
Full Text:

### A constructive proof of the dense existence of nowhere-differentiable functions in $$C[0,1]$$. (English)Zbl 1485.03252

MSC:  03F60 26A27 26A21
Full Text:

Full Text:

Full Text:

Full Text:

### Ordinal analysis with an introduction to proof theory. (English)Zbl 07243781

Logic in Asia: Studia Logica Library. Singapore: Springer (ISBN 978-981-15-6458-1/hbk; 978-981-15-6461-1/pbk; 978-981-15-6459-8/ebook). xvi, 313 p. (2020).
MSC:  03-01 03Fxx
Full Text:

### The legacy of Kurt Schütte. (English)Zbl 1470.03011

Cham: Springer (ISBN 978-3-030-49423-0/hbk; 978-3-030-49426-1/pbk; 978-3-030-49424-7/ebook). xix, 502 p. (2020).
Full Text:

### Spectral spaces versus distributive lattices: a dictionary. (English)Zbl 1440.03060

Facchini, Alberto (ed.) et al., Advances in rings, modules and factorizations. Selected papers based on the presentations at the international conference on rings and factorizations, Graz, Austria, February 19–23, 2018. Cham: Springer. Springer Proc. Math. Stat. 321, 223-245 (2020).
Full Text:

### Kreisel’s interests. On the foundations of logic and mathematics. Contributions of the conference, Salzburg, Austria, August 13–14, 2018. (English)Zbl 1456.03005

Tributes 41. London: College Publications (ISBN 978-1-84890-330-2). viii, 171 p. (2020).

Full Text:

### Finite sets and infinite sets in weak intuitionistic arithmetic. (English)Zbl 1481.03066

MSC:  03F50 03F30
Full Text:

### Well-partial orderings and their maximal order types. (English)Zbl 07218748

Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 351-391 (2020).
MSC:  03Fxx 03Exx 03Dxx
Full Text:

### A combinatorial bound for a restricted form of the termination theorem. (English)Zbl 07218746

Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 321-338 (2020).
MSC:  03Bxx 03Fxx 05Dxx
Full Text:

### Well quasi-orders and the functional interpretation. (English)Zbl 07218744

Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 221-269 (2020).
MSC:  03Fxx
Full Text:

### Upper bounds on the graph minor theorem. (English)Zbl 07218741

Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 145-159 (2020).
MSC:  03Fxx
Full Text:

### A course in constructive algebra. Translated from the English by Henri Lombardi and Stefan Neuwirth. (Un cours d’algèbre constructive.) (French)Zbl 1462.03003

Didactiques. Mathématiques. Besançon: Presses Universitaires de Franche-Comté (ISBN 978-2-84867-782-8/pbk). xii, 399 p. (2020).

Full Text:

### On the constructive truth and falsity in Peano arithmetic. (English)Zbl 1485.03250

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2020, Deerfield Beach, FL, USA, January 04–07, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11972, 75-84 (2020).
MSC:  03F50 03F30
Full Text:

all top 5

all top 5

all top 5

all top 3

all top 3