SIGN IN
SIGN UP
Logic of infons: The propositional case
Full Text:
PDF
Buy this Article
Authors:
Yuri Gurevich
Microsoft Research, Redmond, WA
Itay Neeman
UCLA, Los Angeles, CA
Published in:
· Journal
ACM Transactions on Computational Logic (TOCL)
TOCL Homepage
archive
Volume 12 Issue 2, January 2011
Article No. 9
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1877714.1877715
2011 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 31
· Downloads (cumulative): 220
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
access control
algorithms
complexity
complexity of proof procedures
computational logic
derivation problem
infon
infon logic
intuitionistic logic
languages
linear time
logic
modal logic
model theory
proof theory
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder