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:

Desafío de Lógica Simbólica

Yes or No

Played 2

About this activity

Resuelve preguntas de lógica simbólica.

Created by

Ecuador

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
Desafío de Lógica Simbólica
 

Desafío de Lógica SimbólicaOnline version

Resuelve preguntas de lógica simbólica.

by NANCY PATRICIA ALLÁN VÉLEZ
1

En una tabla de verdad, una oración es una tautología cuando todas las filas dan verdadero.

2

La lógica proposicional utiliza conectivos como: y, o, no, si... entonces.

3

El símbolo del conector lógico ^ indica la operación de disyunció

4

Una contradicción puede ser verdadera en algunas interpretaciones.

5

En lógica simbólica, la negación de una conjunción es la conjunción de las negaciones.

6

En lógica de predicados, un término libre de predicado nunca puede aparecer en una fórmula bien formada.

7

El cuantificador universal ∀ indica existencia de al menos un individuo que cumpla la propiedad.

8

Una tautología es una fórmula que siempre es verdadera, sin importar las valoraciones de las variables.

9

El modo de inferencia modus ponens dice: si p implica q y p es verdadera, entonces q es verdadera.

10

Un argumento válido siempre tiene premisas verdaderas.

Are you sure you want to leave the page?

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