Alternative axioms for NBG or MK












1














While I was thinking about NBG and MK I had the idea for two alternative axioms. As usual $V$ is the class of sets.





The first one:



For a boolean function $f : {T,F}^n to {T,F}$ let $varphi_f(x_1,dots,x_n)$ be a formal representation of $f$. That means for $a_1,dots, a_n in {T,F}$ we have $f(a_1,dots,a_n) = T Leftrightarrow modelsvarphi_f(a_1,dots,a_n)$. (I'm identifying T, F with $top$, $bot$). So for example if $f$ is the AND-function we have $varphi_f = (x_1 wedge x_n)$.



Axiom 1 (scheme):



For all boolean function $f : {T,F}^n to {T,F}$ and all $R_1, dots, R_n in {=,in,subseteq}$:




For all $b_1,dots, b_n in V$ we have



${x; varphi_f(x R_1 b_1, dots, x R_n b_n)} in V quad Leftrightarrow quad negvarphi_f(bot, dots, bot)$ $ $ (or semantically $f(F,dots,F) = F$)




This axiom implies




  • EmptySet $quad$ (choose $n=0$ and $f(langlerangle) = F$; $ langlerangle in {T,F}^0$ is the empty sequence)

  • Pairing $quad$ (choose $n=2$, "$f = AND$" and $R_1,R_2 =; =$)

  • Powerset $quad$ (choose $n=1$, "$f = $ identity" and $R_1 =; subseteq$)

  • SmallUnion $quad$ (choose $n=2$, "$f = OR$" and $R_1, R_2 =; in$)


and others... (Let $a in^2 b :Leftrightarrow exists c (a in c wedge c in b)$. If we allow the $R_i$ to be $in^2$ we have Union too. )



Further: the axiom states that many classes are proper (without the help of other axioms).



And I'm quite sure that this axiom follows from NBG/MK.



If we choose Extensionality, (Foundation), Class Comprehension, Limitation of Size, Infinity and our Axiom 1 we have a version of NBG resp. MK which is easy to remember. What do you think?





The second:



Axiom 2:




If $X$ is a class of non-empty disjoint sets, then $X$ is a set iff there is a choice set for $X$.




(I think the formalisation is clear)



This axiom is a fusion of choice and (at least) a part of replacement. So for example if we have a class function $f: A to B$ and $A$ is a set that contains no pairs, we could build the class $X = { {x, langle x, f(x)rangle}; x in A}$ and use our axiom to conclude that $X$ is a set (since $A$ is obviously a choice set of $X$). With Union and Separation we get that the image of $f$ is a set too.



My first question:



Is Axiom 2 equivalent to choice and replacement (modulo other standard axioms)?





My second question:
Are similar axioms studied somewhere?










share|cite|improve this question
























  • With "choice set of X" I mean a set $A$, so that $A cap x$ is a singleton for all $x in X$.
    – Popov Florino
    Nov 29 at 12:08










  • I see, thanks...
    – Carl Mummert
    Nov 29 at 12:25
















1














While I was thinking about NBG and MK I had the idea for two alternative axioms. As usual $V$ is the class of sets.





The first one:



For a boolean function $f : {T,F}^n to {T,F}$ let $varphi_f(x_1,dots,x_n)$ be a formal representation of $f$. That means for $a_1,dots, a_n in {T,F}$ we have $f(a_1,dots,a_n) = T Leftrightarrow modelsvarphi_f(a_1,dots,a_n)$. (I'm identifying T, F with $top$, $bot$). So for example if $f$ is the AND-function we have $varphi_f = (x_1 wedge x_n)$.



Axiom 1 (scheme):



For all boolean function $f : {T,F}^n to {T,F}$ and all $R_1, dots, R_n in {=,in,subseteq}$:




For all $b_1,dots, b_n in V$ we have



${x; varphi_f(x R_1 b_1, dots, x R_n b_n)} in V quad Leftrightarrow quad negvarphi_f(bot, dots, bot)$ $ $ (or semantically $f(F,dots,F) = F$)




This axiom implies




  • EmptySet $quad$ (choose $n=0$ and $f(langlerangle) = F$; $ langlerangle in {T,F}^0$ is the empty sequence)

  • Pairing $quad$ (choose $n=2$, "$f = AND$" and $R_1,R_2 =; =$)

  • Powerset $quad$ (choose $n=1$, "$f = $ identity" and $R_1 =; subseteq$)

  • SmallUnion $quad$ (choose $n=2$, "$f = OR$" and $R_1, R_2 =; in$)


and others... (Let $a in^2 b :Leftrightarrow exists c (a in c wedge c in b)$. If we allow the $R_i$ to be $in^2$ we have Union too. )



Further: the axiom states that many classes are proper (without the help of other axioms).



And I'm quite sure that this axiom follows from NBG/MK.



If we choose Extensionality, (Foundation), Class Comprehension, Limitation of Size, Infinity and our Axiom 1 we have a version of NBG resp. MK which is easy to remember. What do you think?





The second:



Axiom 2:




If $X$ is a class of non-empty disjoint sets, then $X$ is a set iff there is a choice set for $X$.




(I think the formalisation is clear)



This axiom is a fusion of choice and (at least) a part of replacement. So for example if we have a class function $f: A to B$ and $A$ is a set that contains no pairs, we could build the class $X = { {x, langle x, f(x)rangle}; x in A}$ and use our axiom to conclude that $X$ is a set (since $A$ is obviously a choice set of $X$). With Union and Separation we get that the image of $f$ is a set too.



My first question:



Is Axiom 2 equivalent to choice and replacement (modulo other standard axioms)?





My second question:
Are similar axioms studied somewhere?










share|cite|improve this question
























  • With "choice set of X" I mean a set $A$, so that $A cap x$ is a singleton for all $x in X$.
    – Popov Florino
    Nov 29 at 12:08










  • I see, thanks...
    – Carl Mummert
    Nov 29 at 12:25














1












1








1


1





While I was thinking about NBG and MK I had the idea for two alternative axioms. As usual $V$ is the class of sets.





The first one:



For a boolean function $f : {T,F}^n to {T,F}$ let $varphi_f(x_1,dots,x_n)$ be a formal representation of $f$. That means for $a_1,dots, a_n in {T,F}$ we have $f(a_1,dots,a_n) = T Leftrightarrow modelsvarphi_f(a_1,dots,a_n)$. (I'm identifying T, F with $top$, $bot$). So for example if $f$ is the AND-function we have $varphi_f = (x_1 wedge x_n)$.



Axiom 1 (scheme):



For all boolean function $f : {T,F}^n to {T,F}$ and all $R_1, dots, R_n in {=,in,subseteq}$:




For all $b_1,dots, b_n in V$ we have



${x; varphi_f(x R_1 b_1, dots, x R_n b_n)} in V quad Leftrightarrow quad negvarphi_f(bot, dots, bot)$ $ $ (or semantically $f(F,dots,F) = F$)




This axiom implies




  • EmptySet $quad$ (choose $n=0$ and $f(langlerangle) = F$; $ langlerangle in {T,F}^0$ is the empty sequence)

  • Pairing $quad$ (choose $n=2$, "$f = AND$" and $R_1,R_2 =; =$)

  • Powerset $quad$ (choose $n=1$, "$f = $ identity" and $R_1 =; subseteq$)

  • SmallUnion $quad$ (choose $n=2$, "$f = OR$" and $R_1, R_2 =; in$)


and others... (Let $a in^2 b :Leftrightarrow exists c (a in c wedge c in b)$. If we allow the $R_i$ to be $in^2$ we have Union too. )



Further: the axiom states that many classes are proper (without the help of other axioms).



And I'm quite sure that this axiom follows from NBG/MK.



If we choose Extensionality, (Foundation), Class Comprehension, Limitation of Size, Infinity and our Axiom 1 we have a version of NBG resp. MK which is easy to remember. What do you think?





The second:



Axiom 2:




If $X$ is a class of non-empty disjoint sets, then $X$ is a set iff there is a choice set for $X$.




(I think the formalisation is clear)



This axiom is a fusion of choice and (at least) a part of replacement. So for example if we have a class function $f: A to B$ and $A$ is a set that contains no pairs, we could build the class $X = { {x, langle x, f(x)rangle}; x in A}$ and use our axiom to conclude that $X$ is a set (since $A$ is obviously a choice set of $X$). With Union and Separation we get that the image of $f$ is a set too.



My first question:



Is Axiom 2 equivalent to choice and replacement (modulo other standard axioms)?





My second question:
Are similar axioms studied somewhere?










share|cite|improve this question















While I was thinking about NBG and MK I had the idea for two alternative axioms. As usual $V$ is the class of sets.





The first one:



For a boolean function $f : {T,F}^n to {T,F}$ let $varphi_f(x_1,dots,x_n)$ be a formal representation of $f$. That means for $a_1,dots, a_n in {T,F}$ we have $f(a_1,dots,a_n) = T Leftrightarrow modelsvarphi_f(a_1,dots,a_n)$. (I'm identifying T, F with $top$, $bot$). So for example if $f$ is the AND-function we have $varphi_f = (x_1 wedge x_n)$.



Axiom 1 (scheme):



For all boolean function $f : {T,F}^n to {T,F}$ and all $R_1, dots, R_n in {=,in,subseteq}$:




For all $b_1,dots, b_n in V$ we have



${x; varphi_f(x R_1 b_1, dots, x R_n b_n)} in V quad Leftrightarrow quad negvarphi_f(bot, dots, bot)$ $ $ (or semantically $f(F,dots,F) = F$)




This axiom implies




  • EmptySet $quad$ (choose $n=0$ and $f(langlerangle) = F$; $ langlerangle in {T,F}^0$ is the empty sequence)

  • Pairing $quad$ (choose $n=2$, "$f = AND$" and $R_1,R_2 =; =$)

  • Powerset $quad$ (choose $n=1$, "$f = $ identity" and $R_1 =; subseteq$)

  • SmallUnion $quad$ (choose $n=2$, "$f = OR$" and $R_1, R_2 =; in$)


and others... (Let $a in^2 b :Leftrightarrow exists c (a in c wedge c in b)$. If we allow the $R_i$ to be $in^2$ we have Union too. )



Further: the axiom states that many classes are proper (without the help of other axioms).



And I'm quite sure that this axiom follows from NBG/MK.



If we choose Extensionality, (Foundation), Class Comprehension, Limitation of Size, Infinity and our Axiom 1 we have a version of NBG resp. MK which is easy to remember. What do you think?





The second:



Axiom 2:




If $X$ is a class of non-empty disjoint sets, then $X$ is a set iff there is a choice set for $X$.




(I think the formalisation is clear)



This axiom is a fusion of choice and (at least) a part of replacement. So for example if we have a class function $f: A to B$ and $A$ is a set that contains no pairs, we could build the class $X = { {x, langle x, f(x)rangle}; x in A}$ and use our axiom to conclude that $X$ is a set (since $A$ is obviously a choice set of $X$). With Union and Separation we get that the image of $f$ is a set too.



My first question:



Is Axiom 2 equivalent to choice and replacement (modulo other standard axioms)?





My second question:
Are similar axioms studied somewhere?







set-theory axioms foundations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 29 at 15:44

























asked Nov 29 at 11:18









Popov Florino

1467




1467












  • With "choice set of X" I mean a set $A$, so that $A cap x$ is a singleton for all $x in X$.
    – Popov Florino
    Nov 29 at 12:08










  • I see, thanks...
    – Carl Mummert
    Nov 29 at 12:25


















  • With "choice set of X" I mean a set $A$, so that $A cap x$ is a singleton for all $x in X$.
    – Popov Florino
    Nov 29 at 12:08










  • I see, thanks...
    – Carl Mummert
    Nov 29 at 12:25
















With "choice set of X" I mean a set $A$, so that $A cap x$ is a singleton for all $x in X$.
– Popov Florino
Nov 29 at 12:08




With "choice set of X" I mean a set $A$, so that $A cap x$ is a singleton for all $x in X$.
– Popov Florino
Nov 29 at 12:08












I see, thanks...
– Carl Mummert
Nov 29 at 12:25




I see, thanks...
– Carl Mummert
Nov 29 at 12:25










1 Answer
1






active

oldest

votes


















0














I found an answer to the first question: Yes



Let $f : A to B$ be a class function and $A$ a set



(i) If $f$ is injective we define $C := {a in A; f(a) notin A}$. With separation it is a set. Now we build the class $X = { {a,f(a)}; a in C }$. Since $C$ is a choice set of $X$ (and $X$ is a class of non-empty disjoint sets) we get with Axiom 2 that $X$ is a set. If we have small union, union and separation this implies, that $operatorname{im} f = f(C) cup (A cap operatorname{im} f)$ is a set.



(ii) Now consider an arbitrary class function $f$. $f$ defines an equivalence relation $a sim b :Leftrightarrow f(a) = f(b)$ on $A$. With powerset and separation we get, that the class of equivalence classes $A/{sim} := { [a]_sim; a in A}$ is a set. Since $f_{sim}: A/{sim} to B, [a]_{sim} mapsto f(a)$ is injective, we can use (i) to show that $operatorname{im} f = operatorname{im} f_{sim}$ is a set.



So Axiom 2 implies replacement.






share|cite|improve this answer























  • I hope it is correct now!
    – Popov Florino
    Nov 29 at 13:16











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%2f3018499%2falternative-axioms-for-nbg-or-mk%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









0














I found an answer to the first question: Yes



Let $f : A to B$ be a class function and $A$ a set



(i) If $f$ is injective we define $C := {a in A; f(a) notin A}$. With separation it is a set. Now we build the class $X = { {a,f(a)}; a in C }$. Since $C$ is a choice set of $X$ (and $X$ is a class of non-empty disjoint sets) we get with Axiom 2 that $X$ is a set. If we have small union, union and separation this implies, that $operatorname{im} f = f(C) cup (A cap operatorname{im} f)$ is a set.



(ii) Now consider an arbitrary class function $f$. $f$ defines an equivalence relation $a sim b :Leftrightarrow f(a) = f(b)$ on $A$. With powerset and separation we get, that the class of equivalence classes $A/{sim} := { [a]_sim; a in A}$ is a set. Since $f_{sim}: A/{sim} to B, [a]_{sim} mapsto f(a)$ is injective, we can use (i) to show that $operatorname{im} f = operatorname{im} f_{sim}$ is a set.



So Axiom 2 implies replacement.






share|cite|improve this answer























  • I hope it is correct now!
    – Popov Florino
    Nov 29 at 13:16
















0














I found an answer to the first question: Yes



Let $f : A to B$ be a class function and $A$ a set



(i) If $f$ is injective we define $C := {a in A; f(a) notin A}$. With separation it is a set. Now we build the class $X = { {a,f(a)}; a in C }$. Since $C$ is a choice set of $X$ (and $X$ is a class of non-empty disjoint sets) we get with Axiom 2 that $X$ is a set. If we have small union, union and separation this implies, that $operatorname{im} f = f(C) cup (A cap operatorname{im} f)$ is a set.



(ii) Now consider an arbitrary class function $f$. $f$ defines an equivalence relation $a sim b :Leftrightarrow f(a) = f(b)$ on $A$. With powerset and separation we get, that the class of equivalence classes $A/{sim} := { [a]_sim; a in A}$ is a set. Since $f_{sim}: A/{sim} to B, [a]_{sim} mapsto f(a)$ is injective, we can use (i) to show that $operatorname{im} f = operatorname{im} f_{sim}$ is a set.



So Axiom 2 implies replacement.






share|cite|improve this answer























  • I hope it is correct now!
    – Popov Florino
    Nov 29 at 13:16














0












0








0






I found an answer to the first question: Yes



Let $f : A to B$ be a class function and $A$ a set



(i) If $f$ is injective we define $C := {a in A; f(a) notin A}$. With separation it is a set. Now we build the class $X = { {a,f(a)}; a in C }$. Since $C$ is a choice set of $X$ (and $X$ is a class of non-empty disjoint sets) we get with Axiom 2 that $X$ is a set. If we have small union, union and separation this implies, that $operatorname{im} f = f(C) cup (A cap operatorname{im} f)$ is a set.



(ii) Now consider an arbitrary class function $f$. $f$ defines an equivalence relation $a sim b :Leftrightarrow f(a) = f(b)$ on $A$. With powerset and separation we get, that the class of equivalence classes $A/{sim} := { [a]_sim; a in A}$ is a set. Since $f_{sim}: A/{sim} to B, [a]_{sim} mapsto f(a)$ is injective, we can use (i) to show that $operatorname{im} f = operatorname{im} f_{sim}$ is a set.



So Axiom 2 implies replacement.






share|cite|improve this answer














I found an answer to the first question: Yes



Let $f : A to B$ be a class function and $A$ a set



(i) If $f$ is injective we define $C := {a in A; f(a) notin A}$. With separation it is a set. Now we build the class $X = { {a,f(a)}; a in C }$. Since $C$ is a choice set of $X$ (and $X$ is a class of non-empty disjoint sets) we get with Axiom 2 that $X$ is a set. If we have small union, union and separation this implies, that $operatorname{im} f = f(C) cup (A cap operatorname{im} f)$ is a set.



(ii) Now consider an arbitrary class function $f$. $f$ defines an equivalence relation $a sim b :Leftrightarrow f(a) = f(b)$ on $A$. With powerset and separation we get, that the class of equivalence classes $A/{sim} := { [a]_sim; a in A}$ is a set. Since $f_{sim}: A/{sim} to B, [a]_{sim} mapsto f(a)$ is injective, we can use (i) to show that $operatorname{im} f = operatorname{im} f_{sim}$ is a set.



So Axiom 2 implies replacement.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Dec 14 at 17:10

























answered Nov 29 at 12:15









Popov Florino

1467




1467












  • I hope it is correct now!
    – Popov Florino
    Nov 29 at 13:16


















  • I hope it is correct now!
    – Popov Florino
    Nov 29 at 13:16
















I hope it is correct now!
– Popov Florino
Nov 29 at 13:16




I hope it is correct now!
– Popov Florino
Nov 29 at 13:16


















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.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • 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.


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%2f3018499%2falternative-axioms-for-nbg-or-mk%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

To store a contact into the json file from server.js file using a class in NodeJS

Redirect URL with Chrome Remote Debugging Android Devices

Dieringhausen