1.

Record Nr.

UNISA990001093400203316

Autore

SOCCI, Stefano

Titolo

Bernardo Bertolucci / Stefano Socci

Pubbl/distr/stampa

Milano : Il castoro, 1996

Descrizione fisica

107 p. : ill. ; 17 cm

Collana

Il castoro cinema ; 12

Disciplina

791.430233092

Soggetti

Bertolucci, Bernardo

Collocazione

XIII.2. 127(XVI B COLL 1 BIS/13)

Lingua di pubblicazione

Italiano

Formato

Materiale a stampa

Livello bibliografico

Monografia

2.

Record Nr.

UNINA9910781835603321

Autore

Pensky Max <1961->

Titolo

The ends of solidarity [[electronic resource] ] : discourse theory in ethics and politics / / Max Pensky

Pubbl/distr/stampa

Albany, : State University of New York Press, c2008

ISBN

0-7914-7871-8

1-4356-3901-4

Descrizione fisica

1 online resource (278 p.)

Collana

SUNY series in contemporary continental philosophy

Disciplina

302/.14

Soggetti

Solidarity

Political ethics

Political science - Philosophy

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di bibliografia

Includes bibliographical references (p. 239-258) and index.

Nota di contenuto

Solidarity : the adventures of a concept between fact and norm -- "No



forced unity" : cosmopolitan democracy, national identity, and political solidarity -- Migration and solidarity : studies in immigration law and policy -- Constitutional solidarity and constitutional scope : the dynamics of immigration and the constitutional project of the European Union -- Brussels or Jerusalem? : civil society and religious solidarity in the new Europe -- Justice and solidarity : discourse ethics -- All that bears a human face : genetic technologies, philosophical anthropology, and the ethical self-understanding of the species.

3.

Record Nr.

UNINA9910786636403321

Autore

Davis Martin <1928-2023, >

Titolo

Computability, complexity, and languages : fundamentals of theoretical computer science / / Martin D. Davis, Elaine J. Weyuker

Pubbl/distr/stampa

New York, New York ; ; London, [England] : , : Academic Press, , 1983

©1983

ISBN

1-4832-6458-0

Descrizione fisica

1 online resource (448 p.)

Collana

Computer Science and Applied Mathematics

Disciplina

511.3

Soggetti

Machine theory

Computational complexity

Formal languages

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Description based upon print version of record.

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

Front Cover; Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science; Copyright Page; Dedication; Table of Contents; Preface; Acknowledgments; Dependency Graph; CHAPTER 1. Preliminaries; 1. Sets and n-tuples; 2. Functions; 3. Alphabets and Strings; 4. Predicates; 5. Quantifiers; 6. Proof by Contradiction; 7. Mathematical Induction; PART 1: COMPUTABILITY; CHAPTER 2. Programs and Computable Functions; 1. A Programming Language; 2. Some Examples of Programs; 3. Syntax; 4. Computable Functions; 5. More about Macros; CHAPTER 3. Primitive Recursive Functions

4. Post-Turing ProgramsCHAPTER 6. Turing Machines; 1. Internal States; 2. A Universal Turing Machine; 3. The Languages Accepted by Turing Machines; 4. The Halting Problem for Turing Machines; 5.



Nondeterministic Turing Machines; 6. Variations on the Turing Machine Theme; CHAPTER 7. Processes and Grammars; 1. Semi-Thue Processes; 2. Simulation of Nondeterministic Turing Machines by Semi-Thue Processes; 3. Unsolvable Word Problems; 4. Post's Correspondence Problem; 5. Grammars; 6. Some Unsolvable Problems Concerning Grammars; 7. Recursion and Minimalization; 8. Normal Processes

9. A Non-R.E. SetPART 2: GRAMMARS AND AUTOMATA; CHAPTER 8. Regular Languages; 1. Finite Automata; 2. Nondeterministic Finite Automata; 3. Additional Examples; 4. Closure Properties; 5. Kleene's Theorem; 6. The Pumping Lemma and Its Applications; 7. The Myhill-Nerode Theorem; CHAPTER 9. Context-Free Languages; 1. Context-Free Grammars and Their Derivation Trees; 2. Regular Grammars; 3. Chomsky Normal Form; 4. Bar-Hillel's Pumping Lemma; 5. Closure Properties; 6. Solvable and Unsolvable Problems; 7. Bracket Languages; 8. Pushdown Automata; 9. Compilers and Formal Languages

CHAPTER 10. Context-Sensitive Languages1. The Chomsky Hierarchy; 2. Linear Bounded Automata; 3. Closure Properties; PART 3: LOGIC; CHAPTER 11. Propositional Calculus; 1. Formulas and Assignments; 2. Tautological Inference; 3. Normal Forms; 4. The Davis-Putnam Rules; 5. Minimal Unsatisfiability and Subsumption; 6. Resolution; 7. The Compactness Theorem; CHAPTER 12. Quantification Theory; 1. The Language of Predicate Logic; 2. Semantics; 3. Logical Consequence; 4. Herbrand's Theorem; 5. Unification; 6. Compactness and Countability; 7. Gödel's Incompleteness Theorem

8. Unsolvability of the Satisfiability Problem in Predicate Logic

Sommario/riassunto

Computability, Complexity, and Languages