Completeness theorems, representation theorems: what's the difference?

Abstract
Most areas of logic can be approached either semantically or syntactically. Typically, the approaches are linked through a completeness or representation theorem. The two kinds of theorem serve a similar purpose, yet there also seems to be some residual distinction between them. In what respects do they differ, and how important are the differences? Can we have one without the other? We discuss these questions, with examples from a variety of different logical systems.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Translate to english
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,208
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Conditional Probability in the Light of Qualitative Belief Change.David Makinson - 2011 - Journal of Philosophical Logic 40 (2):121 - 153.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2010-07-25

Total downloads

20 ( #248,666 of 2,172,772 )

Recent downloads (6 months)

1 ( #325,028 of 2,172,772 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums