Elements of Mathematical Logic (test with answers Synergy/MOI/MIT/MOSAP) Score 90/100 points excellent!
A boolean variable is a variable that takes...
any integer value
only one of the following values: 0 or 1
any real values


The ... column of the table contains the values of the function

The formula ... expresses one of De Morgan's laws

The formula expressing the rule of chain conclusion is: ...

The formula expressing the rule "The conjunction is stronger than each of the factors" is: ...

The formula expressing the rule "Disjunction is weaker than each of the terms" is: ...

Variables, instead of which statements can be substituted, are called ... variables
logical
predicate
subject
propositional

A propositional algebra formula is called refutable if...
there is a set of propositions that, when substituted into the formula, will yield a false proposition
when substituting any sets of concrete statements into the formula, we obtain a true statement
there is such a specific set of propositions, when substituting into the formula, a true proposition is obtained
on any set of propositions substituted for propositional variables, it is a false proposition

A boolean function is a function of one or more boolean variables that takes
value 0 only or value 1 only
any real values
any integer value

In the column ... of the table there are disjunction values

15. The formula expressing the rule for combining and separating parcels is: ...

The ... column of the table contains the implication values

The ... column of the table contains the values of the conjunction function

The Modus Рonenc rule has the form ...

A propositional algebra formula is called identically false if...
on any set of propositions substituted for propositional variables, it is a false proposition
there is such a specific set of propositions, when substituting into the formula, a true proposition is obtained
there is a set of propositions that, when substituted into the formula, will yield a false proposition
when substituting any sets of concrete statements into the formula, we obtain a true statement

If at any substitution instead of variables xi from Mi the predicate turns into a false statement, then it is called ...
rebuttable
identically false
doable
identically true

The formula ... expresses one of the absorption laws

The Modus tollens rule has the form ...

A propositional algebra formula is called satisfiable if...
there is a set of propositions that, when substituted into the formula, will yield a false proposition
there is such a specific set of propositions, when substituting into the formula, a true proposition is obtained
when substituting any sets of concrete statements into the formula, we obtain a true statement
on any set of propositions substituted for propositional variables, it is a false proposition

An utterance is an affirmative sentence, which can be ...
either true or false, but not both at the same time
only false
either true or false or both true and false
only true

The predicate P(x1,x2,...,xn) given on the set M=M1x M2 x…xMn is called satisfiable if there is such a set of variables taken from the sets Mi that when substituting them instead of xi we get …
statement
formula
true statement
famous saying