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 Proposicional en Acción

Yes or No

Played 0

About this activity

Proposiciones simples y compuestas

Created by

Honduras

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 Proposicional en Acción
 

Lógica Proposicional en AcciónOnline version

Proposiciones simples y compuestas

by Yeferzon Bonilla
1

El operador '∨' siempre da como resultado verdadero.

2

En 'p → q', si p es falsa, la implicación es falsa.

3

Una proposición simple contiene un solo enunciado, como 'p'.

4

Una proposición simple puede contener dos enunciados.

5

La implicación 'p → q' es falsa solo cuando p es verdadera y q es falsa.

6

Una proposición compuesta se forma uniendo dos o más proposiciones mediante operadores lógicos como 'p ∧ q'.

7

La negación '¬p' invierte el valor de verdad de una proposición.

8

Una contradicción puede ser verdadera si p y ¬p se cumplen al mismo tiempo.

9

Una tautología es una proposición que siempre es verdadera.

10

La negación solo se aplica a proposiciones simples.

Are you sure you want to leave the page?

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