// Numbas version: finer_feedback_settings {"name": "Construir una tablas de verdad para una proposici\u00f3n compuesta (1)", "extensions": [], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "question_groups": [{"pickingStrategy": "all-ordered", "questions": [{"variables": {"p": {"description": "", "definition": "[true,true,false,false]", "templateType": "anything", "group": "Truth values", "name": "p"}, "disp": {"description": "", "definition": "bool_to_label(p)", "templateType": "anything", "group": "Truth values", "name": "disp"}, "a": {"description": "", "definition": "latex(latex_symbol_list[s[0]])", "templateType": "anything", "group": "First Bracket", "name": "a"}, "pre_ev2": {"description": "", "definition": "map(evaluate(convch(a1)+\" \"+conv(op2)+\" \"+convch(b1),[p[t],q[t]]),t,0..3)", "templateType": "anything", "group": "Second Bracket", "name": "pre_ev2"}, "ev2": {"description": "", "definition": "bool_to_label(pre_ev2)", "templateType": "anything", "group": "Second Bracket", "name": "ev2"}, "disq": {"description": "", "definition": "bool_to_label(q)", "templateType": "anything", "group": "Truth values", "name": "disq"}, "b1": {"description": "", "definition": "latex(latex_symbol_list[s[3]])", "templateType": "anything", "group": "Second Bracket", "name": "b1"}, "q": {"description": "", "definition": "[true,false,true,false]", "templateType": "anything", "group": "Truth values", "name": "q"}, "op2": {"description": "", "definition": "latex(random(\"\\\\lor\",\"\\\\land\",\"\\\\to\"))", "templateType": "anything", "group": "Second Bracket", "name": "op2"}, "ev1": {"description": "", "definition": "bool_to_label(pre_ev1)", "templateType": "anything", "group": "First Bracket", "name": "ev1"}, "logic_symbol_list": {"description": "", "definition": "[\"p\",\"q\",\"not p\",\"not q\"]", "templateType": "anything", "group": "Lists of symbols", "name": "logic_symbol_list"}, "pre_ev1": {"description": "", "definition": "map(evaluate(convch(a)+\" \"+conv(op)+\" \"+convch(b),[p[t],q[t]]),t,0..3)", "templateType": "anything", "group": "First Bracket", "name": "pre_ev1"}, "t_value": {"description": "", "definition": "bool_to_label(map(evaluate(pre_ev1[t]+\" \"+conv(op1)+\" \"+pre_ev2[t],[]),t,0..3))", "templateType": "anything", "group": "Ungrouped variables", "name": "t_value"}, "op1": {"description": "", "definition": "latex(random(\"\\\\lor\",\"\\\\land\",\"\\\\to\"))", "templateType": "anything", "group": "Ungrouped variables", "name": "op1"}, "latex_symbol_list": {"description": "", "definition": "[\"p\",\"q\",\"\\\\neg p\",\"\\\\neg q\"]", "templateType": "anything", "group": "Lists of symbols", "name": "latex_symbol_list"}, "op": {"description": "", "definition": "latex(random(\"\\\\lor\",\"\\\\land\",\"\\\\to\"))", "templateType": "anything", "group": "First Bracket", "name": "op"}, "b": {"description": "", "definition": "latex(latex_symbol_list[s[1]])", "templateType": "anything", "group": "First Bracket", "name": "b"}, "a1": {"description": "", "definition": "latex(latex_symbol_list[s[2]])", "templateType": "anything", "group": "Second Bracket", "name": "a1"}, "s": {"description": "", "definition": "repeat(random(0..3),4)", "templateType": "anything", "group": "Lists of symbols", "name": "s"}}, "metadata": {"notes": "", "description": "
Create a truth table for a logical expression of the form $(a \\operatorname{op1} b) \\operatorname{op2}(c \\operatorname{op3} d)$ where $a, \\;b,\\;c,\\;d$ can be the Boolean variables $p,\\;q,\\;\\neg p,\\;\\neg q$ and each of $\\operatorname{op1},\\;\\operatorname{op2},\\;\\operatorname{op3}$ one of $\\lor,\\;\\land,\\;\\to$.
\nFor example: $(p \\lor \\neg q) \\land(q \\to \\neg p)$.
", "licence": "Creative Commons Attribution 4.0 International"}, "advice": "First we find the truth table for $\\var{a} \\var{op} \\var{b}$:
\n$p$ | $q$ | $\\var{a} \\var{op} \\var{b}$ |
---|---|---|
$\\var{disp[0]}$ | \n$\\var{disq[0]}$ | \n$\\var{ev1[0]}$ | \n
$\\var{disp[1]}$ | \n$\\var{disq[1]}$ | \n$\\var{ev1[1]}$ | \n
$\\var{disp[2]}$ | \n$\\var{disq[2]}$ | \n$\\var{ev1[2]}$ | \n
$\\var{disp[3]}$ | \n$\\var{disq[3]}$ | \n$\\var{ev1[3]}$ | \n
Then the truth table for $\\var{a1} \\var{op2} \\var{b1}$:
\n$p$ | $q$ | $\\var{a1} \\var{op2} \\var{b1}$ |
---|---|---|
$\\var{disp[0]}$ | \n$\\var{disq[0]}$ | \n$\\var{ev2[0]}$ | \n
$\\var{disp[1]}$ | \n$\\var{disq[1]}$ | \n$\\var{ev2[1]}$ | \n
$\\var{disp[2]}$ | \n$\\var{disq[2]}$ | \n$\\var{ev2[2]}$ | \n
$\\var{disp[3]}$ | \n$\\var{disq[3]}$ | \n$\\var{ev2[3]}$ | \n
Putting these together to find $(\\var{a} \\var{op} \\var{b})\\var{op1}(\\var{a1} \\var{op2} \\var{b1})$:
\n\n$\\var{a} \\var{op} \\var{b}$ | $\\var{a1} \\var{op2} \\var{b1}$ | $(\\var{a} \\var{op} \\var{b})\\var{op1}(\\var{a1} \\var{op2} \\var{b1})$ |
---|---|---|
$\\var{ev1[0]}$ | \n$\\var{ev2[0]}$ | \n$\\var{t_value[0]}$ | \n
$\\var{ev1[1]}$ | \n$\\var{ev2[1]}$ | \n$\\var{t_value[1]}$ | \n
$\\var{ev1[2]}$ | \n$\\var{ev2[2]}$ | \n$\\var{t_value[2]}$ | \n
$\\var{ev1[3]}$ | \n$\\var{ev2[3]}$ | \n$\\var{t_value[3]}$ | \n
Complete the following truth table:
\n$p$ | $q$ | $\\var{a} \\var{op} \\var{b}$ | $\\var{a1} \\var{op2} \\var{b1}$ | $(\\var{a} \\var{op} \\var{b}) \\var{op1} (\\var{a1} \\var{op2} \\var{b1})$ |
---|---|---|---|---|
$\\var{disp[0]}$ | \n$\\var{disq[0]}$ | \n[[0]] | \n[[4]] | \n[[8]] | \n
$\\var{disp[1]}$ | \n$\\var{disq[1]}$ | \n[[1]] | \n[[5]] | \n[[9]] | \n
$\\var{disp[2]}$ | \n$\\var{disq[2]}$ | \n[[2]] | \n[[6]] | \n[[10]] | \n
$\\var{disp[3]}$ | \n$\\var{disq[3]}$ | \n[[3]] | \n[[7]] | \n[[11]] | \n
In the following question you are asked to construct a truth table for:
\n\\[(\\var{a} \\var{op} \\var{b})\\var{op1}(\\var{a1} \\var{op2} \\var{b1}).\\]
\n\nEnter T if true, else enter F.
\n\n\n\n\n\n\n\n\n\n\n", "preamble": {"css": "", "js": ""}, "variablesTest": {"maxRuns": "150", "condition": "a1 <>b1 and\nif(a='p' or a='\\\\neg p',b=random('q','\\\\neg q'),b=random('p','\\\\neg p'))\n"}, "showQuestionGroupNames": false, "question_groups": [{"questions": [], "name": "", "pickQuestions": 0, "pickingStrategy": "all-ordered"}], "ungrouped_variables": ["op1", "t_value"], "name": "Construir una tablas de verdad para una proposici\u00f3n compuesta (1)", "type": "question", "rulesets": {}, "tags": [], "contributors": [{"name": "Newcastle University Mathematics and Statistics", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/697/"}, {"name": "Luis Hernandez", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/2870/"}]}]}], "contributors": [{"name": "Newcastle University Mathematics and Statistics", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/697/"}, {"name": "Luis Hernandez", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/2870/"}]}