---
title: Logic puzzles are built from small, safe moves: if A always brings B… — Olympiad: logic traps and if-then ★★★ · tree and pragmatics
description: Logic puzzles are built from small, safe moves: if A always brings B and there is no B, then there was no A. Who acts: A, B, A.. A sentence of the lesson «Olympiad: logic traps and if-then ★★★» of the world course of Mova's primary school with its dependency tree and the pragmatics of every clause.
---

<!-- md -->
[Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/school/world/193-olympiad-logic-traps-and-if-then/0/)

<!-- crumbs -->
[home](https://md.mova.elamur.ai/free/en/) / [corpora](https://md.mova.elamur.ai/free/en/corpora/) / [school](https://md.mova.elamur.ai/free/en/corpora/school/) / [World](https://md.mova.elamur.ai/free/en/corpora/school/world/) / [Olympiad: logic traps and if-then ★★★](https://md.mova.elamur.ai/free/en/corpora/school/world/193-olympiad-logic-traps-and-if-then/) / 0

# Olympiad: logic traps and if-then ★★★, sentence 0

<!-- .ven lang=en -->
Logic puzzles are built from small, safe moves: if A always brings B and there is no B, then there was no A.

<!-- .vintro -->
**Who acts:** A, B, A. · **What happens:** build, bring, be · **To what, where:** Logic puzzles, small safe moves, B

<!-- .vabout -->
This is a sentence of the lesson «Olympiad: logic traps and if-then ★★★» of the world course of Mova's primary school. The page gives its syntax tree — a dependency tree in the style of Universal Dependencies — and its pragmatics clause by clause: who acts (A, B, A.), what happens, when and where, as Mova's frames read it from the tree.

## The tree {#tree}

```conllu
# sent_id = school:world:193-olympiad-logic-traps-and-if-then.lesson:0
# text = Logic puzzles are built from small, safe moves: if A always brings B and there is no B, then there was no A.
# source = school lesson (ours)
# course = world
# lesson = 193-olympiad-logic-traps-and-if-then.lesson
# annotation = Mova annot: Rust (en) → Haiku 5.5 (medium, Batches API) patches; gates UD 2.18; agreed by treeagree rules (Stanza, Trankit, spaCy trf): R2-punct-next ×1, R7-rel-agree ×1, R8-pos-agree ×1
1	Logic	logic	NOUN	NN	Number=Sing	2	compound	_	_
2	puzzles	puzzle	NOUN	NNS	Number=Plur	4	nsubj:pass	_	_
3	are	be	AUX	VBP	Mood=Ind|Number=Plur|Person=3|Tense=Pres|VerbForm=Fin	4	aux:pass	_	_
4	built	build	VERB	VBN	Tense=Past|VerbForm=Part|Voice=Pass	0	root	_	_
5	from	from	ADP	IN	_	9	case	_	_
6	small	small	ADJ	JJ	Degree=Pos	9	amod	_	_
7	,	,	PUNCT	,	_	6	punct	_	_
8	safe	safe	ADJ	JJ	Degree=Pos	9	amod	_	_
9	moves	move	NOUN	NNS	Number=Plur	4	obl	_	_
10	:	:	PUNCT	:	_	14	punct	_	_
11	if	if	SCONJ	IN	_	14	mark	_	_
12	A	a	DET	DT	Definite=Ind|PronType=Art	14	nsubj	_	Agree=R7-rel-agree|Haiku=14:det
13	always	always	ADV	RB	PronType=Tot	14	advmod	_	_
14	brings	bring	VERB	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	9	parataxis	_	_
15	B	B	NOUN	NN	Number=Sing	14	obj	_	Agree=R8-pos-agree|Haiku=14:obj|HaikuPos=PROPN:NNP:Number=Sing
16	and	and	CCONJ	CC	_	18	cc	_	_
17	there	there	PRON	EX	PronType=Dem	18	expl	_	_
18	is	be	VERB	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	14	conj	_	_
19	no	no	DET	DT	PronType=Neg	20	det	_	_
20	B	B	NOUN	NN	Number=Sing	18	nsubj	_	_
21	,	,	PUNCT	,	_	24	punct	_	Agree=R2-punct-next|Haiku=14:punct
22	then	then	ADV	RB	PronType=Dem	24	advmod	_	_
23	there	there	PRON	EX	PronType=Dem	24	expl	_	_
24	was	be	VERB	VBD	Mood=Ind|Number=Sing|Person=3|Tense=Past|VerbForm=Fin	14	conj	_	_
25	no	no	DET	DT	PronType=Neg	26	det	_	_
26	A.	A.	PROPN	NNP	Number=Sing	24	nsubj	_	_
```

## Pragmatics {#pragmatics}

<!-- .note -->
No stored speech act for this sentence.

<!-- .fr -->
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| 1 | **build** | present · passive |  | Logic puzzles |  | small safe moves |  |  | vn build-26.1-1 «NP.asset V PP»: subject=Product from move=Material |
| 2 | **bring** *a condition, not said to happen* | present | A | B |  |  |  | always *property* | vn bring-11.3-1 «NP V NP together»: agent=Agent b=Theme |
| 3 | **be** | present | no B |  |  | there |  |  | vn exist-47.1 «NP V»: agent=Theme |
| 4 | **be** | past | no A. |  |  | there | then |  | vn exist-47.1 «NP V»: agent=Theme |

<!-- .note -->
One row per clause the reader finds. «not said here»: a role filled from the clause above. «roles by»: a VerbNet class and frame when one fits the verb, else the reader's rules on the tree.

<!-- div src -->

**Licence: [CC BY-SA 4.0](https://creativecommons.org/licenses/by-sa/4.0/)**, as the whole of Mova corpus 0.4, of which this treebank (the agreed school, `mova-school-agreed-en.conllu`) is part. The lessons were written for Mova's primary school. Sentence `school:world:193-olympiad-logic-traps-and-if-then.lesson:0`.

**The tree:** Mova annot: Rust (en) → Haiku 5.5 (medium, Batches API) patches; gates UD 2.18; agreed by treeagree rules (Stanza, Trankit, spaCy trf): R2-punct-next ×1, R7-rel-agree ×1, R8-pos-agree ×1. **The frames** are read from the tree by Mova's frames reader (`prag`) when this page is built, the lesson read in order, so a pronoun may be resolved from an earlier sentence.

See the [release 0.4](https://md.mova.elamur.ai/free/en/releases/0.4/).

<!-- /div -->

<!-- pn -->
- ← previous: [Olympiad: time and calendar puzzles ★★★, 21](https://md.mova.elamur.ai/free/en/corpora/school/world/192-olympiad-time-and-calendar-puzzles/21/)
- next →: [Olympiad: logic traps and if-then ★★★, 2](https://md.mova.elamur.ai/free/en/corpora/school/world/193-olympiad-logic-traps-and-if-then/2/)
- ↑ back to [the lesson](https://md.mova.elamur.ai/free/en/corpora/school/world/193-olympiad-logic-traps-and-if-then/)

