“An n! Lower bound on formula size”

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 197-206

  Adler, Micah ^a   Immerman, Neil ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; GAME THEORY; MATHEMATICAL OPERATORS; NUMBER THEORY; OPTIMIZATION; POLYNOMIALS; THEOREM PROVING;

BOOLEAN VARIABLES; EHRENFEUCHT-FRAISSE GAME; LOWER BOUND; REACHABILITY LOGIC; TRANSITIVE CLOSURE LOGIC;

BOOLEAN FUNCTIONS;

EID: 0034865337     PISSN: 10436871     EISSN: None     Source Type: Journal    
DOI: 10.1109/ISIT.2001.932497     Document Type: Article

References (14)

1. Reachability logic: An efficient fragment of transitive closure logic
2. Design and synthesis of synchronization skeletons using branching time temporal logic
3. An application of games to the completeness problem for formalized theories
4. Decision procedures and expressiveness in the temporal logic of branching time
5. Tree Canonization and transitive closure
6. An until hierarchy for temporal logic
7. Sur les classifications des systems de relations
8. Languages that capture complexity classes
9. Model checking and transitive closure logic
10. The complexity of propositional linear temporal logics
11. + is exponentially more succinct than CTL