Independent axiomatizability of sets of sentences
type: Item
instance of: scholarly article
title: Independent axiomatizability of sets of sentences
zbMATH Open document ID: 0687.03015
DOI: 10.1016/0168-0072(89)90034-1
author: Piotr Wojtylak
published in: Annals of Pure and Applied Logic
publication date: 1989-01-01T00:00:00Z
review text: Some of the parameters investigated here are familiar: (i) the consequence relation (classical, intuitionistic, etc.), (ii) the cardinality of the sets, and whether they are (equivalent to) (iii) recursive(ly enumerable) sets. Less familiar is attention to (iv) the logical operators by which the sentences are built up and, for the equivalence between two sets X and Y, to (v) whether elements in, say Y are built up from the sentences in X themselves or merely from their propositional letters (top of p. 287). Striking results establish sensitivity to all these parameters. Some of the results are in Reznikoff's earlier published and unpublished work, others correct it. Attention is drawn to ranges, of parameters above, not studied here, for example (p. 273), infinitary propositional operators in (iv) for intuitionistic consequence, and to open problems likely to be overlooked even by a careful reader; for example (p. 292) whether, for classical consequence, every recursive first-order theory has an independent r.e. (and hence recursive) axiomatization. Since many arguments have an algebraic flavour the author notes interpretations in terms familiar from algebra. (But since universal algebra is involved there is not yet any compelling reason to shift the emphasis away from traditional logical formulations.) This line of thought is pursued by \textit{J. Grygiel} in work on so-called absolute independence [Stud. Logica 48, 77-84 (1989)]. The paper shows convincingly that the notion of independent axiomatization passes one test for membership in the household of knowledge: it has a number of memorable properties that are candidates for connecting it with other things one knows or wants to know. A further, also demanding test requires the discovery of such things. The author emphasizes in his introduction a complementary point: the (cl)aims in the early foundational literature for (the suggested consequences of) the notion above are in conflict with experience; as in the ca…
reviewed by: Georg Kreisel
Mathematics Subject Classification ID: 03B99
zbMATH DE Number: 4125379
zbMATH Keywords: independent axiomatization
MaRDI profile type: Publication
full work available at URL: 0168-0072(89)90034-1
OpenAlex ID: W1993090031
cites work: On axiomatizability within a system
cites work: A Theorem on Hypersimple Sets
cites work: Q5519895
cites work: Lindenbaum algebras of intuitionistic theories and free categories
cites work: Choice and well-ordering
cites work: On the quantificational logic of intuitionistic set theory
cites work: Some old and new problems in the independence theory
cites work: Q5572358
cites work: Covers in lattices of quasivarieties and independent axiomatizability
cites work: Some applications of formalized consistency proofs
cites work: Q5599139
cites work: Models of axiomatic systems
cites work: Basic properties of deductive systems based on nonclassical logics. Part I, II
cites work: Independent Axiomatization and its Relation to the Hypersimple Set
cites work: Q5734410
cites work: Q5518345
cites work: Q5518346
cites work: Q5601458
cites work: Q5538907
cites work: Q5573961
cites work: The role of the axiom of induction in elementary arithmetic
cites work: Undecidable theories
cites work: Q3265664
cites work: Systems of Logic Based on Ordinals†
Recommended article: Independence-friendly logic and axiomatic set theory
Recommended article: Some proofs of independence in axiomatic set theory
Recommended article: Absolutely independent axiomatizations for countable sets in classical logic
Recommended article: Axiomatizability by \({\forall \exists!}\)-sentences
Recommended article: Q3220573
Recommended article: Independence of the partial axiom of choice of intuitionistic set theory
Recommended article: Q2936652
Recommended article: Independent Recursive Axiomatizability in Arithmetic
Recommended article: Independence of axioms for biordered sets
Recommended article: Q4735164
description: scientific article; zbMATH DE number 4125379