Jump to ContentJump to Main Navigation

You are looking at 1-7 of 7 items

  • Keywords: decidability x
Clear All Modify Search

View:

Electoral and Party Competition: Analytical Dimensions and Empirical Problems

Stefano Bartolini

in Political Parties: Old Concepts and New Challenges

Published in print:
2002
Published Online:
November 2003
ISBN:
9780199246748
eISBN:
9780191599385
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/0199246742.003.0004
Subject:
Political Science, Comparative Politics

Focuses on the concept of electoral and party competition as the key mechanism leading party elites to respond to the preferences of voters. While competition is of central importance in both ... More


The Limits of Human Mathematics (2001)

Nathan Salmon

in Metaphysics, Mathematics, and Meaning: Philosophical Papers, Volume I

Published in print:
2005
Published Online:
February 2006
ISBN:
9780199284719
eISBN:
9780191603235
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/0199284717.003.0014
Subject:
Philosophy, General

Gödel’s claim is defended that his famous incompleteness theorems yield the result, as a mathematically established fact, that the mathematical problem-solving capacity of the human mind either ... More


The Chomsky hierarchy in perspective

Pieter A. M. Seuren

in From Whorf to Montague: Explorations in the Theory of Language

Published in print:
2013
Published Online:
January 2014
ISBN:
9780199682195
eISBN:
9780191764929
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/acprof:oso/9780199682195.003.0007
Subject:
Linguistics, Historical Linguistics, Semantics and Pragmatics

This chapter discusses the so-called Chomsky hierarchy of grammars, which is based on the presupposition that natural language grammars are algorithmic production systems classified according to the ... More


Decidability: The foundations of mathematics

Marcel Danesi

in Pythagoras' Legacy: Mathematics in Ten Great Ideas

Published in print:
2020
Published Online:
January 2020
ISBN:
9780198852247
eISBN:
9780191886959
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/oso/9780198852247.003.0009
Subject:
Mathematics, History of Mathematics, Educational Mathematics

How do we know if a problem is solvable or a theorem provable? This mode of reasoning takes us into the heart of mathematics. Obviously, if something cannot be solved or proved, we should not be ... More


Formal properties of NLλ

Chris Barker and Chung-Chieh Shan

in Continuations and Natural Language

Published in print:
2014
Published Online:
March 2015
ISBN:
9780199575015
eISBN:
9780191757419
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/acprof:oso/9780199575015.003.0017
Subject:
Linguistics, Semantics and Pragmatics, Psycholinguistics / Neurolinguistics / Cognitive Linguistics

Chapter 17 explores the formal properties of NL‐lambda. This is done indirectly, by first studying NL‐CL, a type‐logical grammar with standard structural postulates. We prove that NL‐CL is sound and ... More


Entscheidungsproblem: What’s in a Word?

Subrata Dasgupta

in It Began with Babbage: The Genesis of Computer Science

Published in print:
2014
Published Online:
November 2020
ISBN:
9780199309412
eISBN:
9780197562857
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/oso/9780199309412.003.0008
Subject:
Computer Science, History of Computer Science

In 1900, the celebrated German mathematician David Hilbert (1862–1943), professor of mathematics in the University of Göttingen, delivered a lecture at the International Mathematics Congress in ... More


An Explosion of Subparadigms

Subrata Dasgupta

in It Began with Babbage: The Genesis of Computer Science

Published in print:
2014
Published Online:
November 2020
ISBN:
9780199309412
eISBN:
9780197562857
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/oso/9780199309412.003.0019
Subject:
Computer Science, History of Computer Science

In 1962, purdue University in West Lafayette, Indiana, in the United States opened a department of computer science with the mandate to offer master’s and doctoral degrees in computer science. Two ... More


View: