Name
Abstract | ||
|---|---|---|
We consider propositional formulas built on implication. The size of a formula is the number of occurrences of variables in it. We assume that two formulas which differ only in the naming of variables are identical. For every n ∈ N, there is a finite number of different formulas of size n. For every n we consider the proportion between the number of intuitionistic tautologies of size n compared with the number of classical tautologies of size n. We prove that the limit of that fraction is 1 when n tends to infinity. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-68103-8_7 | TYPES |
Keywords | Field | DocType |
intuitionistic tautology,finite number,different formula,quantitative comparison,propositional formula,classical tautology,size n | Intuitionistic logic,Boolean function,Discrete mathematics,Tautology (logic),Finite set,Computer science,Catalan number,Infinity,Classical logic,Propositional formula | Conference |
Volume | ISSN | ISBN |
4941 | 0302-9743 | 3-540-68084-5 |
Citations | PageRank | References |
11 | 0.90 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antoine Genitrini | 1 | 68 | 12.06 |
| Jakub Kozik | 2 | 111 | 13.58 |
| Marek Zaionc | 3 | 111 | 17.27 |