Skip to main content

Explore our questions

4 votes
0 answers
98 views

Completeness, Compactness and LST in Type Theory

41 votes
6 answers
2k views

Is there a logic without induction that captures much of P?

5 votes
3 answers
207 views

Why is order/choice an issue for a logic for PTIME

8 votes
1 answer
359 views

In logic programming, what would a language with second-order model theory gain?

14 votes
3 answers
902 views

How do continuations represent negations (under the Curry–Howard correspondence)?

0 votes
1 answer
100 views

Is there a generalized SAT problem for higher-order logics?

1 vote
0 answers
65 views

Why is the model-checking problem for MSO $\textsf{PSPACE}$-complete?

7 votes
0 answers
99 views

Original formulation of Spira's Lemma

17 votes
2 answers
1k views

How to think about coherent spaces intuitively?

0 votes
0 answers
96 views

On the polynomial-size Frege proof of the propositional pigeonhole principle

1 vote
1 answer
322 views

Sparsification and critical clauses in SAT

0 votes
0 answers
50 views

Is hypergraph reachability definable in MSO?

2 votes
1 answer
167 views

Power of existential types

7 votes
2 answers
781 views

Concatenative binary lambda calculus/combinatory logic

Browse more Questions