Results 241 to 250 of about 94,591 (293)

Propositions, Structure and Representation

Proceedings of the Aristotelian Society (Hardback), 2012
Neo-Russellian theories of structured propositions face challenges to do with both representation and structure which are sometimes called the problem of unity and the Benacerraf problem. In Si, I set out the problems and Jeffrey King's solution, which I take to be the best of its type, as well as an unfortunate consequence for that solution ...
openaire   +1 more source

Attitudes and Structured Propositions

2023
AbstractA number of arguments for a fine-grained individuation of propositions are considered in the context of the formal language introduced in the previous chapter, and shown not to be compelling. The main arguments involve ascriptions of propositional attitudes such as belief.
openaire   +1 more source

Minimal Structure Control: A Proposition

IFAC Proceedings Volumes, 2003
Abstract This, the first of a two part paper, aims to propose the new concept of Minimal Structure control. The paper outlines and explains why there is a need for this additional class of multivariable controllers and why it is imperative that they be given a separate identify.
Amin Nobakhti, Neil Munro
openaire   +1 more source

Propositional Structure and Propositional Implication

1982
In this chapter we deepen our characterization of propositions and study the basic structures of propositional implication. Here is, then, a short, but slightly unconventional (because more philosophical), introduction to standard two-valued logic. We need this introduction, not only for completeness, given that propositions are contents of practical ...
openaire   +1 more source

Why the tuple theory of structured propositions isn't a theory of structured propositions

Philosophia, 2003
Much is at stake. The notion of structured propositions – in particular structured singular propositions – is a cornerstone of the theory of direct reference, yet if the intuitive notion of structured proposition cannot possibly translate into ordered ntuples, as direct reference theory does, then that theory finds itself without a semantics in one of ...
openaire   +2 more sources

Why Propositions Have No Structure

Noûs, 2002
The aim of this paper is to shew that, given certain plausible assumptions about meaning, a semantic theory which uses propositions must accept that they are unstructured sets of 'semantical indices'. This does not preclude the possibility that in addition a semantic theory may require structured entities which play some of the roles that propositions ...
openaire   +1 more source

A Theory of Structured Propositions

Philosophical Review, 2023
This paper argues that the theory of structured propositions is not undermined by the Russell-Myhill paradox. I develop a theory of structured propositions in which the Russell-Myhill paradox doesn’t arise: the theory does not involve ramification or compromises to the underlying logic, but rather rejects common assumptions, encoded in the notation of ...
openaire   +1 more source

Structured propositions and shared content

2012
A theory recently advanced by Jeffrey C. King in his 2007 book The Nature and Structure of Content identifies the structure of a structured proposition with the logical form (LF) of a sentence expressing it. I will argue that a theory such as King’s cannot work.
  +4 more sources

Unarticulated Constituents and Propositional Structure

Mind & Language, 2011
Attempts to characterize unarticulated constituents (henceforth: UCs) by means of quantification over the parts of a sentence and the constituents of the proposition it expresses come to grief in more complicated cases than are commonly considered. In particular, UC definitions are inadequate when we consider cases in which the same constituent appears
openaire   +1 more source

Detecting embedded Horn structure in propositional logic

Information Processing Letters, 1992
We show that the problem of finding a maximum renamable Horn problem within a propositional satisfiability problem is NP-hard but can be formulated as a set packing and therefore a maximum clique problem, for which numerous algorithms and heuristics have been developed.
Chandru, V., Hooker, J. N.
openaire   +2 more sources