Axiom Schema vs Axiom The Next CEO of Stack OverflowIs the Subset Axiom Schema in ZF necessary?What properties are allowed in comprehension axiom of ZFC?Axiom schema of specification - Existence of intersection and set differenceQuestion Regarding the Replacement SchemaIs there any set theory without something like the Axiom Schema of Separation?What are the subsets of an infinite set?Axiom of Power SetWhy/When we need the axiom schema of replacement?Is the definability axiom schema consistent with ZF?Finite axiomatization of second-order NBG

Is it convenient to ask the journal's editor for two additional days to complete a review?

Proper way to express "He disappeared them"

Why do remote US companies require working in the US?

Can a Bladesinger Wizard use Bladesong with a Hand Crossbow?

Is French Guiana a (hard) EU border?

Is wanting to ask what to write an indication that you need to change your story?

How to place nodes around a circle from some initial angle?

A Man With a Stainless Steel Endoskeleton (like The Terminator) Fighting Cloaked Aliens Only He Can See

Why isn't the Mueller report being released completely and unredacted?

Reference request: Grassmannian and Plucker coordinates in type B, C, D

Can MTA send mail via a relay without being told so?

Can we say or write : "No, it'sn't"?

Why is information "lost" when it got into a black hole?

Chain wire methods together in Lightning Web Components

What happened in Rome, when the western empire "fell"?

Why this way of making earth uninhabitable in Interstellar?

Running a General Election and the European Elections together

RigExpert AA-35 - Interpreting The Information

Bartok - Syncopation (1): Meaning of notes in between Grand Staff

Why the difference in type-inference over the as-pattern in two similar function definitions?

How to install OpenCV on Raspbian Stretch?

Is it ever safe to open a suspicious HTML file (e.g. email attachment)?

Example of a Mathematician/Physicist whose Other Publications during their PhD eclipsed their PhD Thesis

Why do airplanes bank sharply to the right after air-to-air refueling?



Axiom Schema vs Axiom



The Next CEO of Stack OverflowIs the Subset Axiom Schema in ZF necessary?What properties are allowed in comprehension axiom of ZFC?Axiom schema of specification - Existence of intersection and set differenceQuestion Regarding the Replacement SchemaIs there any set theory without something like the Axiom Schema of Separation?What are the subsets of an infinite set?Axiom of Power SetWhy/When we need the axiom schema of replacement?Is the definability axiom schema consistent with ZF?Finite axiomatization of second-order NBG










1












$begingroup$


So I was reading about the ZFC axioms, and apparently some of them are actually "axiom schemas." For example, there is the "axiom schema of specification," which basically says that give a set $A$ and a formula $phi(x)$, a subset of $A$ exists where all the elements satisfy $phi(x)$.



This is apparently not one axiom, but a schema of infinitely many axioms, because there is one axiom for every $phi(x)$. So that must mean that for whatever reason, just letting $phi(x)$ be an arbitrary formula does not make a valid axiom. So are there rules for what an axiom can say?



So my questions are: Why is this not allowed to be one axiom? What are the rules for what an axiom is allowed to be? And why?










share|cite|improve this question











$endgroup$







  • 1




    $begingroup$
    Not "a schema of infinite axioms", but "a schema of infinitely many axioms" (the first sounds like each axiom may be infinite).
    $endgroup$
    – Alex Kruckman
    7 hours ago










  • $begingroup$
    @AlexKruckman Fair enough. I'll edit to fix that.
    $endgroup$
    – RothX
    7 hours ago















1












$begingroup$


So I was reading about the ZFC axioms, and apparently some of them are actually "axiom schemas." For example, there is the "axiom schema of specification," which basically says that give a set $A$ and a formula $phi(x)$, a subset of $A$ exists where all the elements satisfy $phi(x)$.



This is apparently not one axiom, but a schema of infinitely many axioms, because there is one axiom for every $phi(x)$. So that must mean that for whatever reason, just letting $phi(x)$ be an arbitrary formula does not make a valid axiom. So are there rules for what an axiom can say?



So my questions are: Why is this not allowed to be one axiom? What are the rules for what an axiom is allowed to be? And why?










share|cite|improve this question











$endgroup$







  • 1




    $begingroup$
    Not "a schema of infinite axioms", but "a schema of infinitely many axioms" (the first sounds like each axiom may be infinite).
    $endgroup$
    – Alex Kruckman
    7 hours ago










  • $begingroup$
    @AlexKruckman Fair enough. I'll edit to fix that.
    $endgroup$
    – RothX
    7 hours ago













1












1








1


1



$begingroup$


So I was reading about the ZFC axioms, and apparently some of them are actually "axiom schemas." For example, there is the "axiom schema of specification," which basically says that give a set $A$ and a formula $phi(x)$, a subset of $A$ exists where all the elements satisfy $phi(x)$.



This is apparently not one axiom, but a schema of infinitely many axioms, because there is one axiom for every $phi(x)$. So that must mean that for whatever reason, just letting $phi(x)$ be an arbitrary formula does not make a valid axiom. So are there rules for what an axiom can say?



So my questions are: Why is this not allowed to be one axiom? What are the rules for what an axiom is allowed to be? And why?










share|cite|improve this question











$endgroup$




So I was reading about the ZFC axioms, and apparently some of them are actually "axiom schemas." For example, there is the "axiom schema of specification," which basically says that give a set $A$ and a formula $phi(x)$, a subset of $A$ exists where all the elements satisfy $phi(x)$.



This is apparently not one axiom, but a schema of infinitely many axioms, because there is one axiom for every $phi(x)$. So that must mean that for whatever reason, just letting $phi(x)$ be an arbitrary formula does not make a valid axiom. So are there rules for what an axiom can say?



So my questions are: Why is this not allowed to be one axiom? What are the rules for what an axiom is allowed to be? And why?







logic set-theory axioms






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 7 hours ago







RothX

















asked 7 hours ago









RothXRothX

621713




621713







  • 1




    $begingroup$
    Not "a schema of infinite axioms", but "a schema of infinitely many axioms" (the first sounds like each axiom may be infinite).
    $endgroup$
    – Alex Kruckman
    7 hours ago










  • $begingroup$
    @AlexKruckman Fair enough. I'll edit to fix that.
    $endgroup$
    – RothX
    7 hours ago












  • 1




    $begingroup$
    Not "a schema of infinite axioms", but "a schema of infinitely many axioms" (the first sounds like each axiom may be infinite).
    $endgroup$
    – Alex Kruckman
    7 hours ago










  • $begingroup$
    @AlexKruckman Fair enough. I'll edit to fix that.
    $endgroup$
    – RothX
    7 hours ago







1




1




$begingroup$
Not "a schema of infinite axioms", but "a schema of infinitely many axioms" (the first sounds like each axiom may be infinite).
$endgroup$
– Alex Kruckman
7 hours ago




$begingroup$
Not "a schema of infinite axioms", but "a schema of infinitely many axioms" (the first sounds like each axiom may be infinite).
$endgroup$
– Alex Kruckman
7 hours ago












$begingroup$
@AlexKruckman Fair enough. I'll edit to fix that.
$endgroup$
– RothX
7 hours ago




$begingroup$
@AlexKruckman Fair enough. I'll edit to fix that.
$endgroup$
– RothX
7 hours ago










3 Answers
3






active

oldest

votes


















6












$begingroup$

This is just the choice of underlying logic. ZFC is a theory in first-order logic, and the strictures of that logical system rule out certain kinds of expressions. There are other logics, and their study comprises abstract model theory.



Very roughly, there are two competing hopes for a logical system:



  • It should be expressive: things we intuitively want to be able to say, should be say-able in the system.


  • It should be not too wild: e.g. there should be a well-behaved notion of proof.


It turns out that these are fundamentally in tension. For example, if we want proofs to be finite, then our logical system can't capture infinite structures up to isomorphism (this is the compactness theorem, essentially).



So why did we pick first-order logic after all, given that it forces us to use axiom schemata (and other inefficiencies)? Well, first-order logic seems to sit at a sweet spot here: it's fairly expressive, but also has a very well-behaved notion of proof and a more technical property called the "Lowenheim-Skolem property" which roughly says that it doesn't interact too much with set theory (indeed, it's the most expressive logic with these properties - this is due to Lindstrom).



This paper of Ferrairos may be of interest with regard to how first-order logic emerged as "the" primary logic of mathematics.






share|cite|improve this answer









$endgroup$




















    3












    $begingroup$

    In ZF, all expressions must ultimately be a syntactically valid, finite combination of variable names, the $forall$ quantifier, parentheses, the logical operations $lnot$ and $lor$, $=$ and finally $in$. That's it.



    Of course, in practice we have a lot of other symbols, like $subseteq$ and $exists$, but technically they are all defined as specific shorthands for combinations of the symbols above.



    There is no way to use these to say $forall phi(phitext is a formulatoldots)$, the way one might want to do to make the axiom schema into actual axioms.






    share|cite|improve this answer









    $endgroup$












    • $begingroup$
      I see what you're getting at, but I feel like there's something more. You say that in ZF, all expressions must be as you described. But why? That's not one of the axioms of ZF. Is that a rule for all axioms, or does it only apply in ZF? And either way, why?
      $endgroup$
      – RothX
      7 hours ago






    • 3




      $begingroup$
      +1 and it's probably worth answering the question "why?": Because ZFC is a first-order theory in the language of set theory, which means that its axioms must be sentences of first-order logic in the language with a single binary relation symbol $in$. That is, the logical symbols mentioned in the answer are not chosen arbitrarily, they're the building blocks of first-order logic.
      $endgroup$
      – Alex Kruckman
      7 hours ago






    • 2




      $begingroup$
      As for why we want ZFC to be a first-order theory, this is a more complicated question. It essentially comes down to the fact that (1) first-order logic is restricted enough to have a good proof system, but (2) expressive enough that we can do mathematics in first-order set theory.
      $endgroup$
      – Alex Kruckman
      7 hours ago







    • 1




      $begingroup$
      (It seems I've said almost exactly the same things as Noah did in his concurrently written answer, but he said them better!)
      $endgroup$
      – Alex Kruckman
      7 hours ago


















    1












    $begingroup$

    Noah Schweber pointed out that there is a tension between expressiveness of a logic and having a nice proof theory. There is another tension, between expressiveness and inconsistency.



    More expressive logical systems were developed in the early 1930s by Church (a form of $lambda$ calculus) and separately by Curry (a form of combinatory logic, essentially a different kind of $lambda$ calculus). These logics were more expressive in the sense that they could refer to their own formulas more directly than in first-order logic, essentially by allowing variables to refer to terms or formulas.



    Unfortunately, both of these systems were shown to be inconsistent by Kleene and Rosser in a joint paper in 1935. (Church had already tried to modify his system to avoid inconsistency, but they showed his revised system was inconsistent as well as Curry's system of the time.) More information is available in the article "Paradoxes and Contemporary Logic" by Andrea Cantini and Riccardo Bruni in the Stanford Encyclopedia of Philosophy. (Recall that other, earlier logics systems that tried to be very strong, such as Russell's original system for Principia Mathematica, were also found to be inconsistent.)



    After the inconsistencies were found, Church and Curry both turned their attention to weaker systems, including the simply typed $lambda$ calculus developed by Church. The inconsistent systems slipped into history, but they are still important examples on the limits to what can be put into a logic.



    We now realize that there is a limit on how much a logic can refer to itself. Variations of Richard's paradox and Curry's paradox arise easily with too much self-reference. In a sense, first-order logic and theories such as Peano Arithmetic and ZFC stay just inside this limit. The result is that PA and ZFC are consistent but are subject to Gödel's incompleteness theorems. Adding just slightly more self-reference - which seems to be very hard to avoid in systems that can quantify over and manipulate their own formulas - tends to create systems that are inconsistent or where some terms are undefined or some formulas have undefined truth values. You can't have it all in a consistent logic.



    First-order logic avoids all of this by having no direct way for formulas or terms to refer to or quantify over other formulas or terms. We don't have to worry about undefined terms or undefined truth values, and the logic itself is consistent. A side effect is that infinite lists of formulas sometimes have to be included as infinite lists of axioms, rather than as a single axiom that quantifies over the formulas. This is usually viewed as an acceptable cost, given the other nice properties of the logic.






    share|cite|improve this answer











    $endgroup$













      Your Answer





      StackExchange.ifUsing("editor", function ()
      return StackExchange.using("mathjaxEditing", function ()
      StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
      StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
      );
      );
      , "mathjax-editing");

      StackExchange.ready(function()
      var channelOptions =
      tags: "".split(" "),
      id: "69"
      ;
      initTagRenderer("".split(" "), "".split(" "), channelOptions);

      StackExchange.using("externalEditor", function()
      // Have to fire editor after snippets, if snippets enabled
      if (StackExchange.settings.snippets.snippetsEnabled)
      StackExchange.using("snippets", function()
      createEditor();
      );

      else
      createEditor();

      );

      function createEditor()
      StackExchange.prepareEditor(
      heartbeatType: 'answer',
      autoActivateHeartbeat: false,
      convertImagesToLinks: true,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      bindNavPrevention: true,
      postfix: "",
      imageUploader:
      brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
      contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
      allowUrls: true
      ,
      noCode: true, onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      );



      );













      draft saved

      draft discarded


















      StackExchange.ready(
      function ()
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3168456%2faxiom-schema-vs-axiom%23new-answer', 'question_page');

      );

      Post as a guest















      Required, but never shown

























      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      6












      $begingroup$

      This is just the choice of underlying logic. ZFC is a theory in first-order logic, and the strictures of that logical system rule out certain kinds of expressions. There are other logics, and their study comprises abstract model theory.



      Very roughly, there are two competing hopes for a logical system:



      • It should be expressive: things we intuitively want to be able to say, should be say-able in the system.


      • It should be not too wild: e.g. there should be a well-behaved notion of proof.


      It turns out that these are fundamentally in tension. For example, if we want proofs to be finite, then our logical system can't capture infinite structures up to isomorphism (this is the compactness theorem, essentially).



      So why did we pick first-order logic after all, given that it forces us to use axiom schemata (and other inefficiencies)? Well, first-order logic seems to sit at a sweet spot here: it's fairly expressive, but also has a very well-behaved notion of proof and a more technical property called the "Lowenheim-Skolem property" which roughly says that it doesn't interact too much with set theory (indeed, it's the most expressive logic with these properties - this is due to Lindstrom).



      This paper of Ferrairos may be of interest with regard to how first-order logic emerged as "the" primary logic of mathematics.






      share|cite|improve this answer









      $endgroup$

















        6












        $begingroup$

        This is just the choice of underlying logic. ZFC is a theory in first-order logic, and the strictures of that logical system rule out certain kinds of expressions. There are other logics, and their study comprises abstract model theory.



        Very roughly, there are two competing hopes for a logical system:



        • It should be expressive: things we intuitively want to be able to say, should be say-able in the system.


        • It should be not too wild: e.g. there should be a well-behaved notion of proof.


        It turns out that these are fundamentally in tension. For example, if we want proofs to be finite, then our logical system can't capture infinite structures up to isomorphism (this is the compactness theorem, essentially).



        So why did we pick first-order logic after all, given that it forces us to use axiom schemata (and other inefficiencies)? Well, first-order logic seems to sit at a sweet spot here: it's fairly expressive, but also has a very well-behaved notion of proof and a more technical property called the "Lowenheim-Skolem property" which roughly says that it doesn't interact too much with set theory (indeed, it's the most expressive logic with these properties - this is due to Lindstrom).



        This paper of Ferrairos may be of interest with regard to how first-order logic emerged as "the" primary logic of mathematics.






        share|cite|improve this answer









        $endgroup$















          6












          6








          6





          $begingroup$

          This is just the choice of underlying logic. ZFC is a theory in first-order logic, and the strictures of that logical system rule out certain kinds of expressions. There are other logics, and their study comprises abstract model theory.



          Very roughly, there are two competing hopes for a logical system:



          • It should be expressive: things we intuitively want to be able to say, should be say-able in the system.


          • It should be not too wild: e.g. there should be a well-behaved notion of proof.


          It turns out that these are fundamentally in tension. For example, if we want proofs to be finite, then our logical system can't capture infinite structures up to isomorphism (this is the compactness theorem, essentially).



          So why did we pick first-order logic after all, given that it forces us to use axiom schemata (and other inefficiencies)? Well, first-order logic seems to sit at a sweet spot here: it's fairly expressive, but also has a very well-behaved notion of proof and a more technical property called the "Lowenheim-Skolem property" which roughly says that it doesn't interact too much with set theory (indeed, it's the most expressive logic with these properties - this is due to Lindstrom).



          This paper of Ferrairos may be of interest with regard to how first-order logic emerged as "the" primary logic of mathematics.






          share|cite|improve this answer









          $endgroup$



          This is just the choice of underlying logic. ZFC is a theory in first-order logic, and the strictures of that logical system rule out certain kinds of expressions. There are other logics, and their study comprises abstract model theory.



          Very roughly, there are two competing hopes for a logical system:



          • It should be expressive: things we intuitively want to be able to say, should be say-able in the system.


          • It should be not too wild: e.g. there should be a well-behaved notion of proof.


          It turns out that these are fundamentally in tension. For example, if we want proofs to be finite, then our logical system can't capture infinite structures up to isomorphism (this is the compactness theorem, essentially).



          So why did we pick first-order logic after all, given that it forces us to use axiom schemata (and other inefficiencies)? Well, first-order logic seems to sit at a sweet spot here: it's fairly expressive, but also has a very well-behaved notion of proof and a more technical property called the "Lowenheim-Skolem property" which roughly says that it doesn't interact too much with set theory (indeed, it's the most expressive logic with these properties - this is due to Lindstrom).



          This paper of Ferrairos may be of interest with regard to how first-order logic emerged as "the" primary logic of mathematics.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 7 hours ago









          Noah SchweberNoah Schweber

          128k10151293




          128k10151293





















              3












              $begingroup$

              In ZF, all expressions must ultimately be a syntactically valid, finite combination of variable names, the $forall$ quantifier, parentheses, the logical operations $lnot$ and $lor$, $=$ and finally $in$. That's it.



              Of course, in practice we have a lot of other symbols, like $subseteq$ and $exists$, but technically they are all defined as specific shorthands for combinations of the symbols above.



              There is no way to use these to say $forall phi(phitext is a formulatoldots)$, the way one might want to do to make the axiom schema into actual axioms.






              share|cite|improve this answer









              $endgroup$












              • $begingroup$
                I see what you're getting at, but I feel like there's something more. You say that in ZF, all expressions must be as you described. But why? That's not one of the axioms of ZF. Is that a rule for all axioms, or does it only apply in ZF? And either way, why?
                $endgroup$
                – RothX
                7 hours ago






              • 3




                $begingroup$
                +1 and it's probably worth answering the question "why?": Because ZFC is a first-order theory in the language of set theory, which means that its axioms must be sentences of first-order logic in the language with a single binary relation symbol $in$. That is, the logical symbols mentioned in the answer are not chosen arbitrarily, they're the building blocks of first-order logic.
                $endgroup$
                – Alex Kruckman
                7 hours ago






              • 2




                $begingroup$
                As for why we want ZFC to be a first-order theory, this is a more complicated question. It essentially comes down to the fact that (1) first-order logic is restricted enough to have a good proof system, but (2) expressive enough that we can do mathematics in first-order set theory.
                $endgroup$
                – Alex Kruckman
                7 hours ago







              • 1




                $begingroup$
                (It seems I've said almost exactly the same things as Noah did in his concurrently written answer, but he said them better!)
                $endgroup$
                – Alex Kruckman
                7 hours ago















              3












              $begingroup$

              In ZF, all expressions must ultimately be a syntactically valid, finite combination of variable names, the $forall$ quantifier, parentheses, the logical operations $lnot$ and $lor$, $=$ and finally $in$. That's it.



              Of course, in practice we have a lot of other symbols, like $subseteq$ and $exists$, but technically they are all defined as specific shorthands for combinations of the symbols above.



              There is no way to use these to say $forall phi(phitext is a formulatoldots)$, the way one might want to do to make the axiom schema into actual axioms.






              share|cite|improve this answer









              $endgroup$












              • $begingroup$
                I see what you're getting at, but I feel like there's something more. You say that in ZF, all expressions must be as you described. But why? That's not one of the axioms of ZF. Is that a rule for all axioms, or does it only apply in ZF? And either way, why?
                $endgroup$
                – RothX
                7 hours ago






              • 3




                $begingroup$
                +1 and it's probably worth answering the question "why?": Because ZFC is a first-order theory in the language of set theory, which means that its axioms must be sentences of first-order logic in the language with a single binary relation symbol $in$. That is, the logical symbols mentioned in the answer are not chosen arbitrarily, they're the building blocks of first-order logic.
                $endgroup$
                – Alex Kruckman
                7 hours ago






              • 2




                $begingroup$
                As for why we want ZFC to be a first-order theory, this is a more complicated question. It essentially comes down to the fact that (1) first-order logic is restricted enough to have a good proof system, but (2) expressive enough that we can do mathematics in first-order set theory.
                $endgroup$
                – Alex Kruckman
                7 hours ago







              • 1




                $begingroup$
                (It seems I've said almost exactly the same things as Noah did in his concurrently written answer, but he said them better!)
                $endgroup$
                – Alex Kruckman
                7 hours ago













              3












              3








              3





              $begingroup$

              In ZF, all expressions must ultimately be a syntactically valid, finite combination of variable names, the $forall$ quantifier, parentheses, the logical operations $lnot$ and $lor$, $=$ and finally $in$. That's it.



              Of course, in practice we have a lot of other symbols, like $subseteq$ and $exists$, but technically they are all defined as specific shorthands for combinations of the symbols above.



              There is no way to use these to say $forall phi(phitext is a formulatoldots)$, the way one might want to do to make the axiom schema into actual axioms.






              share|cite|improve this answer









              $endgroup$



              In ZF, all expressions must ultimately be a syntactically valid, finite combination of variable names, the $forall$ quantifier, parentheses, the logical operations $lnot$ and $lor$, $=$ and finally $in$. That's it.



              Of course, in practice we have a lot of other symbols, like $subseteq$ and $exists$, but technically they are all defined as specific shorthands for combinations of the symbols above.



              There is no way to use these to say $forall phi(phitext is a formulatoldots)$, the way one might want to do to make the axiom schema into actual axioms.







              share|cite|improve this answer












              share|cite|improve this answer



              share|cite|improve this answer










              answered 7 hours ago









              ArthurArthur

              121k7121207




              121k7121207











              • $begingroup$
                I see what you're getting at, but I feel like there's something more. You say that in ZF, all expressions must be as you described. But why? That's not one of the axioms of ZF. Is that a rule for all axioms, or does it only apply in ZF? And either way, why?
                $endgroup$
                – RothX
                7 hours ago






              • 3




                $begingroup$
                +1 and it's probably worth answering the question "why?": Because ZFC is a first-order theory in the language of set theory, which means that its axioms must be sentences of first-order logic in the language with a single binary relation symbol $in$. That is, the logical symbols mentioned in the answer are not chosen arbitrarily, they're the building blocks of first-order logic.
                $endgroup$
                – Alex Kruckman
                7 hours ago






              • 2




                $begingroup$
                As for why we want ZFC to be a first-order theory, this is a more complicated question. It essentially comes down to the fact that (1) first-order logic is restricted enough to have a good proof system, but (2) expressive enough that we can do mathematics in first-order set theory.
                $endgroup$
                – Alex Kruckman
                7 hours ago







              • 1




                $begingroup$
                (It seems I've said almost exactly the same things as Noah did in his concurrently written answer, but he said them better!)
                $endgroup$
                – Alex Kruckman
                7 hours ago
















              • $begingroup$
                I see what you're getting at, but I feel like there's something more. You say that in ZF, all expressions must be as you described. But why? That's not one of the axioms of ZF. Is that a rule for all axioms, or does it only apply in ZF? And either way, why?
                $endgroup$
                – RothX
                7 hours ago






              • 3




                $begingroup$
                +1 and it's probably worth answering the question "why?": Because ZFC is a first-order theory in the language of set theory, which means that its axioms must be sentences of first-order logic in the language with a single binary relation symbol $in$. That is, the logical symbols mentioned in the answer are not chosen arbitrarily, they're the building blocks of first-order logic.
                $endgroup$
                – Alex Kruckman
                7 hours ago






              • 2




                $begingroup$
                As for why we want ZFC to be a first-order theory, this is a more complicated question. It essentially comes down to the fact that (1) first-order logic is restricted enough to have a good proof system, but (2) expressive enough that we can do mathematics in first-order set theory.
                $endgroup$
                – Alex Kruckman
                7 hours ago







              • 1




                $begingroup$
                (It seems I've said almost exactly the same things as Noah did in his concurrently written answer, but he said them better!)
                $endgroup$
                – Alex Kruckman
                7 hours ago















              $begingroup$
              I see what you're getting at, but I feel like there's something more. You say that in ZF, all expressions must be as you described. But why? That's not one of the axioms of ZF. Is that a rule for all axioms, or does it only apply in ZF? And either way, why?
              $endgroup$
              – RothX
              7 hours ago




              $begingroup$
              I see what you're getting at, but I feel like there's something more. You say that in ZF, all expressions must be as you described. But why? That's not one of the axioms of ZF. Is that a rule for all axioms, or does it only apply in ZF? And either way, why?
              $endgroup$
              – RothX
              7 hours ago




              3




              3




              $begingroup$
              +1 and it's probably worth answering the question "why?": Because ZFC is a first-order theory in the language of set theory, which means that its axioms must be sentences of first-order logic in the language with a single binary relation symbol $in$. That is, the logical symbols mentioned in the answer are not chosen arbitrarily, they're the building blocks of first-order logic.
              $endgroup$
              – Alex Kruckman
              7 hours ago




              $begingroup$
              +1 and it's probably worth answering the question "why?": Because ZFC is a first-order theory in the language of set theory, which means that its axioms must be sentences of first-order logic in the language with a single binary relation symbol $in$. That is, the logical symbols mentioned in the answer are not chosen arbitrarily, they're the building blocks of first-order logic.
              $endgroup$
              – Alex Kruckman
              7 hours ago




              2




              2




              $begingroup$
              As for why we want ZFC to be a first-order theory, this is a more complicated question. It essentially comes down to the fact that (1) first-order logic is restricted enough to have a good proof system, but (2) expressive enough that we can do mathematics in first-order set theory.
              $endgroup$
              – Alex Kruckman
              7 hours ago





              $begingroup$
              As for why we want ZFC to be a first-order theory, this is a more complicated question. It essentially comes down to the fact that (1) first-order logic is restricted enough to have a good proof system, but (2) expressive enough that we can do mathematics in first-order set theory.
              $endgroup$
              – Alex Kruckman
              7 hours ago





              1




              1




              $begingroup$
              (It seems I've said almost exactly the same things as Noah did in his concurrently written answer, but he said them better!)
              $endgroup$
              – Alex Kruckman
              7 hours ago




              $begingroup$
              (It seems I've said almost exactly the same things as Noah did in his concurrently written answer, but he said them better!)
              $endgroup$
              – Alex Kruckman
              7 hours ago











              1












              $begingroup$

              Noah Schweber pointed out that there is a tension between expressiveness of a logic and having a nice proof theory. There is another tension, between expressiveness and inconsistency.



              More expressive logical systems were developed in the early 1930s by Church (a form of $lambda$ calculus) and separately by Curry (a form of combinatory logic, essentially a different kind of $lambda$ calculus). These logics were more expressive in the sense that they could refer to their own formulas more directly than in first-order logic, essentially by allowing variables to refer to terms or formulas.



              Unfortunately, both of these systems were shown to be inconsistent by Kleene and Rosser in a joint paper in 1935. (Church had already tried to modify his system to avoid inconsistency, but they showed his revised system was inconsistent as well as Curry's system of the time.) More information is available in the article "Paradoxes and Contemporary Logic" by Andrea Cantini and Riccardo Bruni in the Stanford Encyclopedia of Philosophy. (Recall that other, earlier logics systems that tried to be very strong, such as Russell's original system for Principia Mathematica, were also found to be inconsistent.)



              After the inconsistencies were found, Church and Curry both turned their attention to weaker systems, including the simply typed $lambda$ calculus developed by Church. The inconsistent systems slipped into history, but they are still important examples on the limits to what can be put into a logic.



              We now realize that there is a limit on how much a logic can refer to itself. Variations of Richard's paradox and Curry's paradox arise easily with too much self-reference. In a sense, first-order logic and theories such as Peano Arithmetic and ZFC stay just inside this limit. The result is that PA and ZFC are consistent but are subject to Gödel's incompleteness theorems. Adding just slightly more self-reference - which seems to be very hard to avoid in systems that can quantify over and manipulate their own formulas - tends to create systems that are inconsistent or where some terms are undefined or some formulas have undefined truth values. You can't have it all in a consistent logic.



              First-order logic avoids all of this by having no direct way for formulas or terms to refer to or quantify over other formulas or terms. We don't have to worry about undefined terms or undefined truth values, and the logic itself is consistent. A side effect is that infinite lists of formulas sometimes have to be included as infinite lists of axioms, rather than as a single axiom that quantifies over the formulas. This is usually viewed as an acceptable cost, given the other nice properties of the logic.






              share|cite|improve this answer











              $endgroup$

















                1












                $begingroup$

                Noah Schweber pointed out that there is a tension between expressiveness of a logic and having a nice proof theory. There is another tension, between expressiveness and inconsistency.



                More expressive logical systems were developed in the early 1930s by Church (a form of $lambda$ calculus) and separately by Curry (a form of combinatory logic, essentially a different kind of $lambda$ calculus). These logics were more expressive in the sense that they could refer to their own formulas more directly than in first-order logic, essentially by allowing variables to refer to terms or formulas.



                Unfortunately, both of these systems were shown to be inconsistent by Kleene and Rosser in a joint paper in 1935. (Church had already tried to modify his system to avoid inconsistency, but they showed his revised system was inconsistent as well as Curry's system of the time.) More information is available in the article "Paradoxes and Contemporary Logic" by Andrea Cantini and Riccardo Bruni in the Stanford Encyclopedia of Philosophy. (Recall that other, earlier logics systems that tried to be very strong, such as Russell's original system for Principia Mathematica, were also found to be inconsistent.)



                After the inconsistencies were found, Church and Curry both turned their attention to weaker systems, including the simply typed $lambda$ calculus developed by Church. The inconsistent systems slipped into history, but they are still important examples on the limits to what can be put into a logic.



                We now realize that there is a limit on how much a logic can refer to itself. Variations of Richard's paradox and Curry's paradox arise easily with too much self-reference. In a sense, first-order logic and theories such as Peano Arithmetic and ZFC stay just inside this limit. The result is that PA and ZFC are consistent but are subject to Gödel's incompleteness theorems. Adding just slightly more self-reference - which seems to be very hard to avoid in systems that can quantify over and manipulate their own formulas - tends to create systems that are inconsistent or where some terms are undefined or some formulas have undefined truth values. You can't have it all in a consistent logic.



                First-order logic avoids all of this by having no direct way for formulas or terms to refer to or quantify over other formulas or terms. We don't have to worry about undefined terms or undefined truth values, and the logic itself is consistent. A side effect is that infinite lists of formulas sometimes have to be included as infinite lists of axioms, rather than as a single axiom that quantifies over the formulas. This is usually viewed as an acceptable cost, given the other nice properties of the logic.






                share|cite|improve this answer











                $endgroup$















                  1












                  1








                  1





                  $begingroup$

                  Noah Schweber pointed out that there is a tension between expressiveness of a logic and having a nice proof theory. There is another tension, between expressiveness and inconsistency.



                  More expressive logical systems were developed in the early 1930s by Church (a form of $lambda$ calculus) and separately by Curry (a form of combinatory logic, essentially a different kind of $lambda$ calculus). These logics were more expressive in the sense that they could refer to their own formulas more directly than in first-order logic, essentially by allowing variables to refer to terms or formulas.



                  Unfortunately, both of these systems were shown to be inconsistent by Kleene and Rosser in a joint paper in 1935. (Church had already tried to modify his system to avoid inconsistency, but they showed his revised system was inconsistent as well as Curry's system of the time.) More information is available in the article "Paradoxes and Contemporary Logic" by Andrea Cantini and Riccardo Bruni in the Stanford Encyclopedia of Philosophy. (Recall that other, earlier logics systems that tried to be very strong, such as Russell's original system for Principia Mathematica, were also found to be inconsistent.)



                  After the inconsistencies were found, Church and Curry both turned their attention to weaker systems, including the simply typed $lambda$ calculus developed by Church. The inconsistent systems slipped into history, but they are still important examples on the limits to what can be put into a logic.



                  We now realize that there is a limit on how much a logic can refer to itself. Variations of Richard's paradox and Curry's paradox arise easily with too much self-reference. In a sense, first-order logic and theories such as Peano Arithmetic and ZFC stay just inside this limit. The result is that PA and ZFC are consistent but are subject to Gödel's incompleteness theorems. Adding just slightly more self-reference - which seems to be very hard to avoid in systems that can quantify over and manipulate their own formulas - tends to create systems that are inconsistent or where some terms are undefined or some formulas have undefined truth values. You can't have it all in a consistent logic.



                  First-order logic avoids all of this by having no direct way for formulas or terms to refer to or quantify over other formulas or terms. We don't have to worry about undefined terms or undefined truth values, and the logic itself is consistent. A side effect is that infinite lists of formulas sometimes have to be included as infinite lists of axioms, rather than as a single axiom that quantifies over the formulas. This is usually viewed as an acceptable cost, given the other nice properties of the logic.






                  share|cite|improve this answer











                  $endgroup$



                  Noah Schweber pointed out that there is a tension between expressiveness of a logic and having a nice proof theory. There is another tension, between expressiveness and inconsistency.



                  More expressive logical systems were developed in the early 1930s by Church (a form of $lambda$ calculus) and separately by Curry (a form of combinatory logic, essentially a different kind of $lambda$ calculus). These logics were more expressive in the sense that they could refer to their own formulas more directly than in first-order logic, essentially by allowing variables to refer to terms or formulas.



                  Unfortunately, both of these systems were shown to be inconsistent by Kleene and Rosser in a joint paper in 1935. (Church had already tried to modify his system to avoid inconsistency, but they showed his revised system was inconsistent as well as Curry's system of the time.) More information is available in the article "Paradoxes and Contemporary Logic" by Andrea Cantini and Riccardo Bruni in the Stanford Encyclopedia of Philosophy. (Recall that other, earlier logics systems that tried to be very strong, such as Russell's original system for Principia Mathematica, were also found to be inconsistent.)



                  After the inconsistencies were found, Church and Curry both turned their attention to weaker systems, including the simply typed $lambda$ calculus developed by Church. The inconsistent systems slipped into history, but they are still important examples on the limits to what can be put into a logic.



                  We now realize that there is a limit on how much a logic can refer to itself. Variations of Richard's paradox and Curry's paradox arise easily with too much self-reference. In a sense, first-order logic and theories such as Peano Arithmetic and ZFC stay just inside this limit. The result is that PA and ZFC are consistent but are subject to Gödel's incompleteness theorems. Adding just slightly more self-reference - which seems to be very hard to avoid in systems that can quantify over and manipulate their own formulas - tends to create systems that are inconsistent or where some terms are undefined or some formulas have undefined truth values. You can't have it all in a consistent logic.



                  First-order logic avoids all of this by having no direct way for formulas or terms to refer to or quantify over other formulas or terms. We don't have to worry about undefined terms or undefined truth values, and the logic itself is consistent. A side effect is that infinite lists of formulas sometimes have to be included as infinite lists of axioms, rather than as a single axiom that quantifies over the formulas. This is usually viewed as an acceptable cost, given the other nice properties of the logic.







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited 7 mins ago

























                  answered 31 mins ago









                  Carl MummertCarl Mummert

                  67.7k7133252




                  67.7k7133252



























                      draft saved

                      draft discarded
















































                      Thanks for contributing an answer to Mathematics Stack Exchange!


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid


                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.

                      Use MathJax to format equations. MathJax reference.


                      To learn more, see our tips on writing great answers.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3168456%2faxiom-schema-vs-axiom%23new-answer', 'question_page');

                      );

                      Post as a guest















                      Required, but never shown





















































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown

































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown







                      Popular posts from this blog

                      名間水力發電廠 目录 沿革 設施 鄰近設施 註釋 外部連結 导航菜单23°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.7113923°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.71139計畫概要原始内容臺灣第一座BOT 模式開發的水力發電廠-名間水力電廠名間水力發電廠 水利署首件BOT案原始内容《小檔案》名間電廠 首座BOT水力發電廠原始内容名間電廠BOT - 經濟部水利署中區水資源局

                      Prove that NP is closed under karp reduction?Space(n) not closed under Karp reductions - what about NTime(n)?Class P is closed under rotation?Prove or disprove that $NL$ is closed under polynomial many-one reductions$mathbfNC_2$ is closed under log-space reductionOn Karp reductionwhen can I know if a class (complexity) is closed under reduction (cook/karp)Check if class $PSPACE$ is closed under polyonomially space reductionIs NPSPACE also closed under polynomial-time reduction and under log-space reduction?Prove PSPACE is closed under complement?Prove PSPACE is closed under union?

                      Is my guitar’s action too high? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Strings too stiff on a recently purchased acoustic guitar | Cort AD880CEIs the action of my guitar really high?Μy little finger is too weak to play guitarWith guitar, how long should I give my fingers to strengthen / callous?When playing a fret the guitar sounds mutedPlaying (Barre) chords up the guitar neckI think my guitar strings are wound too tight and I can't play barre chordsF barre chord on an SG guitarHow to find to the right strings of a barre chord by feel?High action on higher fret on my steel acoustic guitar