// Numbas version: finer_feedback_settings
{"name": "Daniel's copy of Quantifiers 2-", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "question_groups": [{"pickingStrategy": "all-ordered", "questions": [{"variablesTest": {"maxRuns": 100, "condition": ""}, "ungrouped_variables": ["all", "marks"], "name": "Daniel's copy of Quantifiers 2-", "variables": {"select1": {"templateType": "anything", "group": "Part 1", "definition": "list(set(0..length(all)-1)-set(select))[0..4]", "name": "select1", "description": ""}, "all": {"templateType": "anything", "group": "Ungrouped variables", "definition": "[['There is someone not known to the rest.',\n    '$\\\\exists m \\\\forall n (\\\\neg P(n,m))$'],\n  ['Every group member doesn\\'t know the name of at least one other.',\n    '$\\\\forall m \\\\exists n (\\\\neg P(m,n))$'],\n  ['Nobody knows the name of anybody else.',\n    '$\\\\forall m \\\\forall n (\\\\neg P(m,n))$'],\n  ['There is a pair of group members who do not know each other\\'s name.',\n    '$\\\\exists m \\\\exists n (\\\\neg P(m,n) \\\\land \\\\neg P(n,m))$'],\n  ['There is someone who knows everyone\\'s name.',\n    '$\\\\exists m \\\\forall n (P(m,n))$'],\n  ['There is at least one person who knows the name of somebody else.',\n    '$\\\\exists m \\\\exists n (P(n,m))$'],\n  ['There is someone who doesn\\'t know the name of at least one other group member.',\n    '$\\\\exists m \\\\exists n (\\\\neg P(n,m))$'],\n  ['Someone\\'s name is known to everyone else.',\n    '$\\\\exists m \\\\forall n ( P(n,m))$'],\n  ['There is at least one person who does not know the name of anybody else.',\n    '$\\\\exists m \\\\forall n (\\\\neg P(m,n))$'],\n  ['Everybody knows at least one other person\\'s name.',\n    '$\\\\forall m \\\\exists n (P(m,n))$'],\n  ['Any member of the group has at least one person who doesn\\'t know their name.',\n    '$\\\\forall n \\\\exists m (\\\\neg P(m,n))$'],\n  ['There are at least two people who know each other\\'s name.',\n    '$\\\\exists n \\\\exists m (P(n,m) \\\\land P(m,n))$']\n  \n  ]", "name": "all", "description": ""}, "marks": {"templateType": "anything", "group": "Ungrouped variables", "definition": "matrix(list(0.5id(4)-0.25matrix(repeat(repeat(1,4),4))))", "name": "marks", "description": ""}, "select2": {"templateType": "anything", "group": "Part 2", "definition": "list(set(0..length(all)-1)-(set(select) or set(select1)))", "name": "select2", "description": ""}, "select": {"templateType": "anything", "group": "Part 0", "definition": "shuffle(list(0..length(all)-1))[0..4]", "name": "select", "description": ""}}, "parts": [{"showCorrectAnswer": true, "variableReplacements": [], "shuffleChoices": true, "maxMarks": 0, "customName": "", "unitTests": [], "marks": 0, "minAnswers": "0", "matrix": "marks", "useCustomName": false, "answers": ["<p>{all[select[0]][1]}</p>", "<p>{all[select[1]][1]}<strong><br /></strong></p>", "<p>{all[select[2]][1]}<strong><br /></strong></p>", "<p>{all[select[3]][1]}<strong><br /></strong></p>"], "shuffleAnswers": false, "variableReplacementStrategy": "originalfirst", "type": "m_n_x", "showCellAnswerState": true, "showFeedbackIcon": true, "maxAnswers": "4", "layout": {"type": "all", "expression": ""}, "minMarks": 0, "extendBaseMarkingAlgorithm": true, "warningType": "warn", "choices": ["<span style=\"font-size: small;\">{all[select[0]][0]}</span>", "<span style=\"font-size: small;\">{all[select[1]][0]}</span>", "<span style=\"font-size: small;\">{all[select[2]][0]}</span>", "<span style=\"font-size: small;\">{all[select[3]][0]}</span>"], "scripts": {}, "customMarkingAlgorithm": "", "displayType": "radiogroup"}, {"showCorrectAnswer": true, "variableReplacements": [], "shuffleChoices": true, "maxMarks": 0, "customName": "", "unitTests": [], "marks": 0, "minAnswers": "0", "matrix": "marks", "useCustomName": false, "answers": ["<p>{all[select1[0]][1]}</p>", "<p>{all[select1[1]][1]}</p>", "<p>{all[select1[2]][1]}</p>", "<p>{all[select1[3]][1]}</p>"], "shuffleAnswers": false, "variableReplacementStrategy": "originalfirst", "type": "m_n_x", "showCellAnswerState": true, "showFeedbackIcon": true, "maxAnswers": "4", "layout": {"type": "all", "expression": ""}, "minMarks": 0, "extendBaseMarkingAlgorithm": true, "warningType": "warn", "choices": ["<span style=\"font-size: small;\">{all[select1[0]][0]}</span>", "<span style=\"font-size: small;\">{all[select1[1]][0]}</span>", "<span style=\"font-size: small;\">{all[select1[2]][0]}</span>", "<span style=\"font-size: small;\">{all[select1[3]][0]}</span>"], "scripts": {}, "customMarkingAlgorithm": "", "displayType": "radiogroup"}, {"showCorrectAnswer": true, "variableReplacements": [], "shuffleChoices": true, "maxMarks": 0, "customName": "", "unitTests": [], "marks": 0, "minAnswers": "0", "matrix": "marks", "useCustomName": false, "answers": ["<p>{all[select2[0]][1]}</p>", "<p>{all[select2[1]][1]}</p>", "<p>{all[select2[2]][1]}</p>", "<p>{all[select2[3]][1]}</p>"], "shuffleAnswers": false, "variableReplacementStrategy": "originalfirst", "type": "m_n_x", "showCellAnswerState": true, "showFeedbackIcon": true, "maxAnswers": "4", "layout": {"type": "all", "expression": ""}, "minMarks": 0, "extendBaseMarkingAlgorithm": true, "warningType": "warn", "choices": ["<span style=\"font-size: small;\">{all[select2[0]][0]}</span>", "<span style=\"font-size: small;\">{all[select2[1]][0]}</span>", "<span style=\"font-size: small;\">{all[select2[2]][0]}</span>", "<span style=\"font-size: small;\">{all[select2[3]][0]}</span>"], "scripts": {}, "customMarkingAlgorithm": "", "displayType": "radiogroup"}], "variable_groups": [{"name": "Part 0", "variables": ["select"]}, {"name": "Part 1", "variables": ["select1"]}, {"name": "Part 2", "variables": ["select2"]}], "extensions": [], "advice": "<p>When the symbol $\\forall$ appears, read it as \"for all\" or \"for every\".&nbsp;</p>\n<p>When the symbol $\\exists$ appears, read it as \"there exists\" or \"for some (particular)\".&nbsp;</p>\n<p>Keep in mind that the order these symbols appear in matters! You can think of the first term making $m$ the \"subject\" of the sentence and the second term making $n$ the \"object\" of the sentence.&nbsp;</p>", "statement": "<p>In a seminar group, for group members $m$ and $n$, we let $P(m,n)$ to be the predicate&nbsp;<strong><em>m knows the name of n&nbsp;</em></strong>.</p>\n<p>For each English sentence choose the corresponding proposition involving quantifiers.</p>\n<p>Note that marks are deducted for each incorrect choice. However, the minimum mark is $0$.</p>", "preamble": {"css": "", "js": ""}, "rulesets": {}, "tags": [], "functions": {}, "metadata": {"description": "<p>English sentences which are propositions are given and for each the appropriate proposition&nbsp;&nbsp;involving quantifiers is to be chosen.&nbsp;</p>", "licence": "Creative Commons Attribution 4.0 International"}, "type": "question", "contributors": [{"name": "Daniel Mansfield", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/743/"}, {"name": "Sean Gardiner", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/2443/"}]}]}], "contributors": [{"name": "Daniel Mansfield", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/743/"}, {"name": "Sean Gardiner", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/2443/"}]}