Skip to main content
    • Aa
    • Aa



Completeness and other forms of Zorn’s Lemma are sometimes invoked for semantic proofs of conservation in relatively elementary mathematical contexts in which the corresponding syntactical conservation would suffice. We now show how a fairly general syntactical conservation theorem that covers plenty of the semantic approaches follows from an utmost versatile criterion for conservation given by Scott in 1974.

To this end we work with multi-conclusion entailment relations as extending single-conclusion entailment relations. In a nutshell, the additional axioms with disjunctions in positive position can be eliminated by reducing them to the corresponding disjunction elimination rules, which in turn prove admissible in all known mathematical instances. In deduction terms this means to fold up branchings of proof trees by way of properties of the relevant mathematical structures.

Applications include the syntactical counterparts of the theorems or lemmas known under the names of Artin–Schreier, Krull–Lindenbaum, and Szpilrajn. Related work has been done before on individual instances, e.g., in locale theory, dynamical algebra, formal topology and proof analysis.

Hide All
[1] AczelP., IshiharaH., NemotoT., and SanguY., Generalized geometric theories and set-generated classes . Mathematical Structures in Computer Science, vol. 25 (2015), no. 7, pp. 14661483.
[2] AczelP. and RathjenM., Notes on constructive set theory , Technical report, Institut Mittag–Leffler, 2000/01, Report No. 40.
[3] AczelP. and RathjenM., Constructive set theory , Book draft, 2010.
[4] ArtinE., Über die Zerlegung definiter Funktionen in Quadrate . Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 5 (1927), no. 1, pp. 100115.
[5] ArtinE. and SchreierO., Algebraische Konstruktion reeller Körper . Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 5 (1927), no. 1, pp. 8599.
[6] AvronA., Simple consequence relations . Information and Computation, vol. 92 (1991), pp. 105139.
[7] BasuS., PollackR., and RoyM.-F., Algorithms in Real Algebraic Geometry, Springer, Berlin, 2003.
[8] BishopE., Foundations of Constructive Analysis, McGraw-Hill, New York, 1967.
[9] BishopE. and BridgesD., Constructive Analysis, Springer, Berlin and Heidelberg, 1985.
[10] BochnakJ., CosteM., and RoyM.-F., Real Algebraic Geometry, Springer-Verlag, Berlin, 1998.
[11] CederquistJ. and CoquandT., Entailment relations and distributive lattices , Logic Colloquium ’98. (BussS. R., HájekP., and PudlákP., editors), Lecture Notes Logic, vol. 13, A. K. Peters, Natick, MA, 2000, pp. 127139.
[12] CederquistJ., CoquandT., and NegriS., The Hahn-Banach theorem in type theory , Twenty-five Years of Constructive Type Theory (Venice, 1995) (SambinG. and SmithJ. M., editors), Oxford Logic Guides, vol. 36, Oxford University Press, New York, 1998, pp. 5772.
[13] CirauloF., RinaldiD., and SchusterP., Lindenbaum’s lemma via open induction , Advances in Proof Theory (KahleR., StrahmT., and StuderT., editors), Progress in Computer Science and Applied Logic, vol. 28, Birkhäuser, Basel, 2016, pp. 6577.
[14] CirauloF. and SambinG., Finitary formal topologies and Stone’s representation theorem . Theoretical Computer Science, vol. 405 (2008), no. 1–2, pp. 1123.
[15] CoquandT., Two applications of Boolean models . Archive for Mathematical Logic, vol. 37 (1998), no. 3, pp. 143147.
[16] CoquandT., A direct proof of the localic Hahn-Banach theorem, 2000. Manuscript, available from author’s webpage,∼coquand/formal.html.
[17] CoquandT., Lewis Carroll, Gentzen and entailment relations, 2000. Manuscript, available from the author’s website,∼coquand/formal.html.
[18] CoquandT., Geometric Hahn-Banach theorem . Mathematical Proceedings of the Cambridge Philosophical Society, vol. 140 (2006), pp. 313315.
[19] CoquandT., Space of valuations . Annals of Pure and Applied Logic, vol. 157 (2009), pp. 97109.
[20] CoquandT. and LombardiH., Hidden constructions in abstract algebra (3): Krull dimension of distributive lattices and commutative rings , Commutative Ring Theory and Applications (FontanaM., KabbajS.-E., and WiegandS., editors), Lecture Notes in Pure and Applied Mathematics, vol. 231, Marcel Dekker, New York, 2002, pp. 477499.
[21] CoquandT. and LombardiH., A logical approach to abstract algebra.Mathematical Structures in Computer Science, vol. 16 (2006), pp. 885900.
[22] CoquandT., LombardiH., and NeuwirthS., Lorenzen’s theory of divisibility , preprint, 2016.
[23] CoquandT., LombardiH., and NeuwirthS., Lattice-ordered groups generated by ordered groups and regular systems of ideals , preprint, 2017,
[24] CoquandT. and PerssonH., Valuations and Dedekind’s Prague theorem . Journal of Pure and Applied Algebra, vol. 155 (2001), no. 2–3, pp. 121129.
[25] CoquandT. and ZhangG.-Q., Sequents, frames, and completeness , Computer science logic 2000 (CloteP. G. and ScwichtenbergH., editors), Lecture Notes in Computer Science, vol. 1862, Springer, Berlin, 2000, pp. 277291.
[26] CosteM., LombardiH., and RoyM.-F., Dynamical method in algebra: Effective Nullstellensätze . Annals of Pure and Applied Logic, vol. 111 (2001), no. 3, pp. 203256.
[27] DelzellC. N., Kreisel’s Unwinding of Artin’s Proof , Kreiseliana. (OdifreddiP., editor), A K Peters, Wellesley, MA, 1996, pp. 113246.
[28] DelzellC. N., González-VegaL., and LombardiH., A continuous and rational solution to Hilbert’s 17th problem and several cases of the Positivstellensatz , Computational Algebraic Geometry (EyssetteF. and GalligoA., editors), Birkhäuser, Boston, MA, 1993, pp. 6175.
[29] DošenK., On passing from singular to plural consequences , Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa (OrlowskaE., editor), Studies in Fuzziness and Soft Computing, vol. 24, Physica, Heidelberg, 1999, pp. 533547.
[30] GabbayD. M., Semantical Investigations in Heyting’s Intuitionistic Logic , Synthese Library, vol. 148, D. Reidel Publishing Co., Dordrecht-Boston, MA, 1981.
[31] GentzenG., Untersuchungen über das logische Schließen I. Mathematische Zeitschrift, vol. 39 (1934), pp. 176210.
[32] GentzenG., Untersuchungen über das logische Schließen II. Mathematische Zeitschrift, vol. 39 (1934), pp. 405431.
[33] HanssonB., Choice structures and preference relations . Synthese, vol. 18 (1968), no. 4, pp. 443458.
[34] HertzP., Über Axiomensysteme für beliebige Satzsysteme. I. Teil. Sätze ersten Grades . Mathematische Annalen, vol. 87 (1922), no. 3, pp. 246269.
[35] HertzP., Über Axiomensysteme für beliebige Satzsysteme. II. Teil. Sätze höheren Grades . Mathematische Annalen, vol. 89 (1923), no. 1, pp. 76102.
[36] HertzP., Über Axiomensysteme für beliebige Satzsysteme . Mathematische Annalen, vol. 101 (1929), no. 1, pp. 457514.
[37] HumberstoneL., On a conservative extension argument of Dana Scott . Logic Journal of the IGPL, vol. 19 (2011), pp. 241288.
[38] HumberstoneL., Dana Scott’s work with generalized consequence relations , Universal Logic: An Anthology - From Paul Hertz to Dov Gabbay (BéziauJ.-Y.), Studies in Universal Logic, Birkhäuser, Basel, 2012, pp. 263279.
[39] IshiharaH. and NemotoT., Non-deterministic inductive definitions and fullness , Concepts of Proof in Mathematics, Philosophy, and Computer Science (ProbstD. and SchusterP., editors), Ontos Mathematical Logic, vol. 6, Walter de Gruyter, Berlin, 2016, pp. 163170.
[40] JohnstoneP. T., Sketches of an Elephant: A Topos Theory Compendium, vol. 1, Oxford Logic Guides, vol. 43, The Clarendon Press Oxford University Press, New York, 2002.
[41] KrullW., Idealtheorie in Ringen ohne Endlichkeitsbedingung . Annals of Mathematics, vol. 101 (1929), pp. 729744.
[42] LombardiH., Le contenu constructif d’un principe local-global avec une application à la structure d’un module projectif de type fini , Publications Mathématiques de Besançon. Algèbre et Théorie des Nombres, 1997, Fascicule 9495 & 95–96.
[43] LombardiH., Relecture constructive de la théorie d’Artin-Schreier . Annals of Pure and Applied Logic, vol. 91 (1998), pp. 5992.
[44] LombardiH., Hidden constructions in abstract algebra. I. Integral dependance . Journal of Pure and Applied Algebra, vol. 167 (2002), pp. 259267.
[45] LombardiH., Algèbre dynamique, espaces topologiques sans points et programme de Hilbert . Annals of Pure and Applied Logic, vol. 137 (2006), pp. 256290.
[46] LombardiH. and QuittéC., Commutative Algebra: Constructive Methods: Finite Projective Modules, Springer, Netherlands, Dordrecht, 2015.
[47] LorenzenP., Über halbgeordnete Gruppen . Mathematische Zeitschrift, vol. 52 (1950), no. 1, pp. 483526.
[48] LorenzenP., Algebraische und logistische Untersuchungen über freie Verbände . The Journal of Symbolic Logic, vol. 16 (1951), no. 2, pp. 81106.
[49] LorenzenP., Teilbarkeitstheorie in Bereichen . Mathematische Zeitschrift, vol. 55 (1952), no. 3, pp. 269275.
[50] LorenzenP., Die Erweiterung halbgeordneter Gruppen zu Verbandsgruppen . Mathematische Zeitschrift, vol. 58 (1953), no. 1, pp. 1524.
[51] McKubre-JordensM., Material implications over minimal logic (joint work with Hannes Diener) , Conference Presentation, May 2016, Mathematics for Computation, Benediktinerabtei Niederaltaich, Germany, 813 May 2016.
[52] MinesR., RichmanF., and RuitenburgW., A Course in Constructive Algebra, Universitext, Springer, New York, 1988.
[53] MulveyC. J. and Wick-PelletierJ., The dual locale of a seminormed space . Cahiers de topologie et géométrie différentielle catégoriques, vol. 23 (1982), no. 1, pp. 7392.
[54] MulveyC. J. and Wick-PelletierJ., A globalization of the Hahn-Banach theorem . Advances in Mathematics, vol. 89 (1991), pp. 159.
[55] NegriS., Stone bases alias the constructive content of Stone representation , Logic and Algebra. (UrsiniA. and AglianòP., editors), Lecture Notes in Pure and Applied Mathematics, vol. 180, Marcel Dekker, New York, 1996, pp. 617636.
[56] NegriS., Continuous domains as formal spaces . Mathematical Structures in Computer Science, vol. 12 (2002), no. 1, pp. 1952.
[57] NegriS. and von PlatoJ., Proof Analysis, Cambridge University Press, Cambridge, 2011.
[58] NegriS., von PlatoJ., and CoquandT., Proof-theoretical analysis of order relations . Archive for Mathematical Logic, vol. 43 (2004), pp. 297309.
[59] PayetteG. and SchotchP. K., Remarks on the Scott–Lindenbaum theorem . Studia Logica, vol. 102 (2014), no. 5, pp. 10031020.
[60] PrestelA. and DelzellC. N., Positive Polynomials. From Hilbert’s 17th Problem to Real Algebra, Springer-Verlag, Berlin, 2001.
[61] RaoultJ.-C., Proving open properties by induction . Information Processing Letters, vol. 29 (1988), no. 1, pp. 1923.
[62] RinaldiD., Formal Methods in the Theories of Rings and Domains, Doctoral dissertation, Universität München, 2014.
[63] RinaldiD. and SchusterP., A universal Krull-Lindenbaum theorem . Journal of Pure and Applied Algebra, vol. 220 (2016), pp. 32073232.
[64] SambinG., Intuitionistic formal spaces—a first communication , Mathematical Logic and its Applications (SkordevD., editor), Plenum, New York, 1987, pp. 187204.
[65] SchusterP., Induction in algebra: A first case study , 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE Computer Society Publications, 2012, Proceedings, LICS 2012, Dubrovnik, Croatia, pp. 581585.
[66] SchusterP., Induction in algebra: A first case study . Logical Methods in Computer Science, vol. 9 (2013), no. 3, p. 20.
[67] SchwichtenbergH. and SenjakC., Minimal from classical proofs . Annals of Pure and Applied Logic, vol. 164 (2013), pp. 740748.
[68] ScottD., On engendering an illusion of understanding . Journal of Philosophy, vol. 68 (1971), pp. 787807.
[69] ScottD., Completeness and axiomatizability in many-valued logic , Proceedings of the Tarski Symposium (HenkinL., AddisonJ., ChangC. C., CraigW., ScottD., and VaughtR., editors), American Mathematical Society, Providence, RI, 1974, pp. 411435.
[70] ScottD. S., Background to formalization , Truth, Syntax and Modality (LeblancH., editor), Studies in Logic and the Foundations of Mathematics, vol. 68, North-Holland, Amsterdam, 1973, pp. 244273.
[71] ShoenfieldJ. R., Mathematical Logic, Addison-Wesley, Reading, MA, 1967.
[72] ShoesmithD. J. and SmileyT. J., Multiple-Conclusion Logic, Cambridge University Press, Cambridge, 1978.
[73] SzpilrajnE., Sur l’extension de l’ordre partiel . Fundamenta Mathematicae, vol. 16 (1930), pp. 368389.
[74] TarskiA., Fundamentale Begriffe der Methodologie der deduktiven Wissenschaften . I. Monatshefte für Mathematik und Physik, vol. 37 (1930), pp. 361404.
[75] TroelstraA. S. and SchwichtenbergH., Basic Proof Theory, second ed., Cambridge University Press, Cambridge, 2000.
[76] van den BergB., Non-deterministic inductive definitions . Archive for Mathematical Logic, vol. 52 (2013), no. 1–2, pp. 113135.
[77] WójcickiR., Theory of Logical Calculi. Basic Theory of Consequence Operations, Synthese Library, vol. 199, Kluwer Academic Publishers Group, Dordrecht, 1988.
[78] YenguiI., Constructive Commutative Algebra. Projective Modules Over Polynomial Rings and Dynamical Gröbner Bases, Lecture Notes in Mathematics, vol. 2138, Springer International Publishing, Switzerland, 2015.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Bulletin of Symbolic Logic
  • ISSN: 1079-8986
  • EISSN: 1943-5894
  • URL: /core/journals/bulletin-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 32 *
Loading metrics...

Abstract views

Total abstract views: 118 *
Loading metrics...

* Views captured on Cambridge Core between 21st June 2017 - 21st October 2017. This data will be updated every 24 hours.