Logic Quick Quiz

Oui ou Non

Parties jouées 2

Créer une copie

À propos de cette activité

Test your logic skills with true/false questions.

Créé par

Salah-eddine Aynouche

Morocco

Téléchargez la version pour jouer sur papier

Top 10 résultats

Il n'y a toujours pas de résultats pour ce jeu. Soyez le premier à apparaître dans le classement! Connectez-vous pour vous identifier.

Créez votre propre jeu gratuite à partir de notre créateur de jeu

Affrontez vos amis pour voir qui obtient le meilleur score dans ce jeu

Créer un défi

		%
	Anonyme	%
		%
		%

Imprimez votre jeu

Logic Quick Quiz


Logic Quick QuizVersion en ligne Test your logic skills with true/false questions. par Salah-eddine Aynouche 1 A deductive argument is valid if the conclusion follows from the premises by form. Yes No 2 The law of non-contradiction allows a proposition and its negation to be true together. Yes No 3 A valid argument guarantees true premises. Yes No 4 A biconditional P↔Q is true when P and Q share the same truth value. Yes No 5 In propositional logic, P ∧ ¬P is always true. Yes No 6 A truth table lists all possible truth values for propositions. Yes No 7 Modus ponens: from P→Q and P, infer Q. Yes No 8 A statement can be both true and false at the same time in classical logic. Yes No 9 The law of the excluded middle states that every proposition is both true and false. Yes No 10 A fallacy is an error in reasoning that weakens an argument. Yes No 11 A tautology is a formula that is true in every possible truth assignment. Yes No 12 In classical logic, a statement can be both true and false at the same time. Yes No 13 p -> q is equivalent to p and q. Yes No 14 De Morgan's laws: not (p and q) is equivalent to (not p) or (not q). Yes No 15 In propositional logic, p and q is true only when both p and q are true. Yes No 16 The material implication p -> q is true whenever p is false, regardless of q. Yes No 17 A logical contradiction can be true in some cases. Yes No 18 The contrapositive of an implication p -> q is logically equivalent to if not q then not p. Yes No 19 The only valid inference rule in logic is Modus Ponens. Yes No 20 The universal quantifier means 'there exists at least one'. Yes No

Vous pouvez intégrer le jeu dans un LMS compatible avec LTI 1.1 ou LTI 1.3 comme Canvas, Moodle ou Blackboard. Les scores seront ainsi automatiquement enregistrés dans le carnet de notes de la plateforme.

Logic Quick Quiz

Oui ou Non

À propos de cette activité

Créé par

Téléchargez la version pour jouer sur papier

Top Jeux

Oui ou Non

Is it created with Artificial Intelligence? - Complete game

Oui ou Non

Grammys for best song/record

Oui ou Non

Is it true?

Oui ou Non

Foot and Ankle Anatomy Quiz

Oui ou Non

Adjective Checker

Logic Quick QuizVersion en ligne

par Salah-eddine Aynouche

A deductive argument is valid if the conclusion follows from the premises by form.

The law of non-contradiction allows a proposition and its negation to be true together.

A valid argument guarantees true premises.

A biconditional P↔Q is true when P and Q share the same truth value.

In propositional logic, P ∧ ¬P is always true.

A truth table lists all possible truth values for propositions.

Modus ponens: from P→Q and P, infer Q.

A statement can be both true and false at the same time in classical logic.

The law of the excluded middle states that every proposition is both true and false.

A fallacy is an error in reasoning that weakens an argument.

A tautology is a formula that is true in every possible truth assignment.

In classical logic, a statement can be both true and false at the same time.

p -> q is equivalent to p and q.

De Morgan's laws: not (p and q) is equivalent to (not p) or (not q).

In propositional logic, p and q is true only when both p and q are true.

The material implication p -> q is true whenever p is false, regardless of q.

A logical contradiction can be true in some cases.

The contrapositive of an implication p -> q is logically equivalent to if not q then not p.

The only valid inference rule in logic is Modus Ponens.

The universal quantifier means 'there exists at least one'.