Skip to content

Commit ec8ca31

Browse files
author
Alexander Steen
authored
Update README.md
1 parent 342bcae commit ec8ca31

File tree

1 file changed

+85
-1
lines changed

1 file changed

+85
-1
lines changed

README.md

Lines changed: 85 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -37,6 +37,90 @@ problem, suitable parameters are given as properties to the logic specification:
3737
| `$$pal` | _none_ | |
3838
| `$$ddl` | `$$system` | Selects which DDL logic system is employed: Carmo and Jones or Åqvist's system E.<br><br>Accepted values: `$$carmoJones` or `$$aqvistE` |
3939

40+
### Examples
41+
42+
#### Logic `$modal`
43+
The so-called Barcan formula is a modal logic formula that is valid if and only if the quantification domain of the underlying first-order
44+
modal logic model is non-cumulative.
45+
46+
```
47+
tff(modal_k5, logic, $modal == [
48+
$constants == $rigid,
49+
$quantification == $decreasing,
50+
$modalities == [$modal_axiom_K, $modal_axiom_5]
51+
] ).
52+
53+
tff(bf, conjecture, ( ![X]: ({$box}(f(X))) ) => {$box}(![X]: f(X)) ).
54+
```
55+
56+
#### Logic `$$hybrid`
57+
58+
```
59+
tff(hybrid_s5,logic, $$hybrid == [
60+
$constants == $rigid,
61+
$quantification == $varying,
62+
$modalities == $modal_system_S5
63+
] ).
64+
65+
tff(1, conjecture, ![X]: {$box}({$$shift(#n)}(
66+
{$$bind(#Y)}((Y & p(X))
67+
<=>
68+
({$$nominal}(n) & p(X))
69+
))) ).
70+
```
71+
72+
#### Logic `$$pal`
73+
74+
```
75+
tff(pal, logic, $$pal == []).
76+
77+
tff(c, conjecture, {$$announce($$formula := p)}( {$$common($$group := [a,b,c,k])}(p) )).
78+
```
79+
80+
#### Logic `$$ddl`
81+
82+
83+
```
84+
tff(spec_e, logic, $$ddl == [ $$system == $$aqvistE ] ).
85+
86+
tff(a1, axiom, {$$obl}(go,$true)).
87+
tff(a2, axiom, {$$obl}(tell, go)).
88+
tff(a3, axiom, {$$obl}(~tell, ~go)).
89+
tff(situation, axiom, ~go).
90+
tff(c, conjecture, {$$obl}(~tell,$true)).
91+
```
92+
This example encodes that (a1) you ought to go and help your neighbor, (a2) if you go then you ought to tell him/her that you are coming,
93+
and (a3) if you don't go, then you ought not tell him/her. It can consistently be inferred that, if you actually don't go, then you ought not
94+
tell.
95+
96+
### Extended specifications
97+
98+
#### Modal logic `$modal`
99+
100+
Multiple modal operators are defined like ...
101+
```
102+
thf(advanced,logic,(
103+
$modal ==
104+
[ $constants == $rigid,
105+
$quantification == $cumulative,
106+
$modalities ==
107+
[ $modal_system_S5,
108+
[#a] == $modal_system_KB,
109+
[#b] == $modal_system_K ] ] )).
110+
```
111+
Here box operator a is system KB, box operator b is K. Of course, also lists of axiom schemes can be used. All further modal operators are S5 (if existent).
112+
113+
Distinct quantification semantics for each type are defined like ...
114+
```
115+
thf(quantification,logic,(
116+
$modal ==
117+
[ $constants == $rigid,
118+
$quantification ==
119+
[ $constant,
120+
human_type == $varying ],
121+
$modalities == $modal_system_S5 ] )).
122+
```
123+
Here, every quantification over variables of type `human_type` are varying domain, all others constant domain.
40124

41125

42126
## Usage
@@ -53,7 +137,7 @@ usage: embedproblem [-l <logic>] [-p <parameter>] [-s <spec>=<value>] [--tstp] <
53137
-l <logic>
54138
If <problem file> does not contain a logic specification statement, explicitly set
55139
the input format to <logic>. Ignored, if <problem file> contains a logic specification statement.
56-
Supported <logic>s are: $modal, $alethic_modal, $deontic_modal, $epistemic_modal
140+
Supported <logic>s are: $modal, $epistemic_modal, $$ddl, $$pal, $alethic_modal, $$hybrid, $deontic_modal
57141
58142
-p <parameter>
59143
Pass transformation parameter <parameter> to the embedding procedure.

0 commit comments

Comments
 (0)