Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange
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
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
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 Search options user 56687

Questions related to mathematical logic and its use in computer science

2
votes
0answers
question is: Is there an intuitive explanation of why this is true? I've read an $n$ step proof in modal logic, but my intuition is not improved by it. …
asked Jun 25 '18 by user56834
5
votes
2answers
In the book "topology via logic" by Steven Vickers, topology is introduced for computer scientists, with the idea that topology captures the idea of approximate information. I am somewhat confused …
asked Feb 13 by user56834
1
vote
0answers
I know that there exist type theory based proof-checker, and I know that there are logic/sequent-calculus based automated theorem provers. But I haven’t heard of a type-theory based automated …
asked Nov 10 '18 by user56834
2
votes
0answers
easily follow. e.g. a computer can easily calculate $5349\cdot 5345=...$ There is a "mechanical" proof-system, most importantly, first order logic, which also operates according to well-defined rules … structure, for use in a logic-language? This computational problem is essentially: given e.g. the rules of arithmetic, find a first-order statement that we can use as an axiom to then derive further …
asked Apr 2 '18 by user56834
1
vote
0answers
Propositional extentionality in the lean theorem prover is stated as the following axiom: axiom proptext {a b : Prop} : (a $\iff$ b) \to a = b My confusion about this is as follows: Previously I …
asked Nov 11 '18 by user56834
0
votes
0answers
This is a rather strong claim, and therefore likely to be incorrect, but hear me out. Firstly, when I talk of “computations”, I mean this in a broader sense than normally used, because I am including …
asked Mar 2 by user56834