Equivocation Axiom on First Order Languages

Studia Logica 105 (1):121-152 (2017)
  Copy   BIBTEX

Abstract

In this paper we investigate some mathematical consequences of the Equivocation Principle, and the Maximum Entropy models arising from that, for first order languages. We study the existence of Maximum Entropy models for these theories in terms of the quantifier complexity of the theory and will investigate some invariance and structural properties of such models.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2016-10-04

Downloads
47 (#348,443)

6 months
17 (#161,763)

Historical graph of downloads
How can I increase my downloads?