Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with logic
Search options not deleted
user 79013
Questions related to mathematical logic and its use in computer science
0
votes
1
answer
303
views
Can this set of propositions be represented and proved in Haskell?
I used a set of natural language statements and their formalization from Gries and Schneider. I attempted to transform the propositions into Haskell equations. For example, for S0 : $a \land w \Righ …
- 339
1
vote
0
answers
198
views
Proving a first order logic theorem in equational logic with a term rewriting system
I am trying to translate and prove a theorem, originally written in first order logic (FOL), into a combination of equational logic (EL) and Boolean logic (BL) (more precisely a model of Boolean Algebra … In general, this can be written as $\Gamma \models_{EL+BL+Sk} \varphi$, which means that under $EL+BL+Sk$ logic the sentence $\varphi$ is true in all models of $\Gamma$. …
- 339
4
votes
0
answers
296
views
Can every sentence of first-order logic be converted into an equisatisfiable equation in Boo...
In particular, the BOOL module can be viewed as a formalisation of propositional logic defined by a set of equations. … Proof
A combination of Equational Logic, Boolean Algebra, and order sorted term rewriting is used for proof. …
- 339