Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

JSYML
2000

favoriteEmaildiscussreport

45views more JSYML 2000»

Topological Completeness for Higher-Order Logic

13 years 5 months ago

Topological Completeness for Higher-Order Logic

Download www.brics.dk

Steven Awodey, Carsten Butz

Real-time Traffic

JSYML 2000 |

claim paper

Related Content

» Typed HigherOrder Narrowing without HigherOrder Strategies

» A Complete Narrowing Calculus for HigherOrder Functional Logic Programming

» Extensional HigherOrder Resolution

» HOLCF Higher Order Logic of Computable Functions

» Logical Reasoning for HigherOrder Functions with Local State

» Termination and Reduction Checking for HigherOrder Logic Programs

» Program Logics for Sequential HigherOrder Control

» HigherOrder Coalition Logic

» The Complexity of Model Checking HigherOrder Fixpoint Logic

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	JSYML
Authors	Steven Awodey, Carsten Butz

Comments (0)