New answers tagged logic
0
votes
Hoare Logic: Identifying Hoare Triple given a simple function
The postcondition is the intended sorting effect, $u_1\le u_2$.
if (x < y) {
u_1 = x;
u_2 = y;
} else {
u_1 = y;
u_2 = x;
} // u_1 <= u_2
So ...
2
votes
Is this LTL formula really valid?
The formula $\phi \mathrm{U} \psi$ is satisfied if $\psi$ is true right now. If we express it as "eventually $\psi$ becomes true and until then $\phi$ holds", it is important to remember ...
1
vote
Is this LTL formula really valid?
Consider a computation $\pi = \sigma_1, \sigma_2, \ldots$ over $2^{AP}$. For $j\geq 1$, let $\pi^j$ denote the suffix $\sigma_j, \sigma_{j+1}, \ldots$ of $\pi$. Then, the semantics of the $U$ operator ...
6
votes
How to make a NAND gate with vaccum tubes?
So... let's try to answer this in a computer sciency way, so we can get across the general idea without knowing too much about electronics.
But first, let's be clear on what we mean by "the NAND ...
2
votes
Accepted
Is Monotone Not-Exactly-1 3SAT solvable in polynomial time?
Monotone Not-Exactly-1 3SAT problem (MNE1 3-SAT)
This problem involves determining whether a Boolean formula in CNF, where each clause contains exactly three positive literals (no negations), can be ...
Top 50 recent answers are included
Related Tags
logic × 1017first-order-logic × 132
propositional-logic × 118
complexity-theory × 80
satisfiability × 76
algorithms × 71
boolean-algebra × 63
computability × 49
linear-temporal-logic × 48
lambda-calculus × 45
type-theory × 41
proof-techniques × 39
terminology × 38
programming-languages × 36
model-checking × 32
formal-languages × 29
reference-request × 29
circuits × 29
formal-methods × 25
hoare-logic × 24
temporal-logic × 24
automated-theorem-proving × 23
computer-architecture × 22
proof-assistants × 22
computation-tree-logic × 21