New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Lógica computacional: Quiz

Quiz

Played 2

About this activity

Quiz de lógica proposicional

Created by

Colombia

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Lógica computacional: Quiz
 

Lógica computacional: QuizOnline version

Quiz de lógica proposicional

by Dannia Lisseth Herrera Ramirez
1

¿Qué define una tautología en lógica proposicional?

2

¿Qué operador corresponde a la negación de una proposición A?

3

¿Qué ley dice que P ∨ (P ∧ Q) es igual a P?

4

¿Cuál es la equivalencia entre P ∧ Q y Q ∧ P?

5

Si P → Q es verdadero y P es verdadero, ¿qué se deduce de P → Q?

6

¿Qué forma muestra la equivalencia entre P ∨ Q y ¬P → Q?

7

¿Qué operador resulta de aplicar De Morgan a (A ∧ B)?

8

¿Qué garantiza la tabla de verdad de una proposición?

9

¿Qué significa que dos proposiciones sean lógicamente equivalentes?

10

¿Qué regla permite distribuir ∧ sobre ∨ en una expresión? (P ∧ (Q ∨ R))

Explicación

La tautología es siempre verdadera sin importar las asignaciones de verdad.

La negación de A se expresa como ¬A.

La absorción simplifica con la forma P ∨ (P ∧ Q) = P.

La conmutatividad indica que el orden no importa.

Una implicación verdadera con P verdadero implica Q verdadero.

P ∨ Q es lógicamente equivalente a ¬P → Q.

De Morgan: ¬(A ∧ B) = ¬A ∨ ¬B.

La tabla de verdad enumera todas las combinaciones de verdad.

Equivalentes: P ≡ Q tienen la misma verdad en todas las filas.

Distributividad: P ∧ (Q ∨ R) = (P ∧ Q) ∨ (P ∧ R).

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.