The computational complexity of logical theories
Author(s)
Bibliographic Information
The computational complexity of logical theories
（Lecture notes in mathematics, 718）
Springer-Verlag, 1979
- : Berlin
- : New York
Available at / 81 libraries
-
Library & Science Information Center, Osaka Prefecture University
: BerlinNDC8:410.8||||10007177110
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNM||7187908076S
-
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science研究室
: Berlin510/L4972021040687
-
No Libraries matched.
- Remove all filters.
Note
Bibliography: p. [234]-238
Includes index
Description and Table of Contents
- Volume
-
: New York ISBN 9780387095011
Description
The book will synthesize and integrate better what are often disparate ideas, themes, and methods across substantive areas of white-collar crime and criminology and criminal justice.
The book also puts together critical and emerging topics within criminology and criminal justice that have important implications for the study of white-collar crime and criminology/criminal justice more generally.
Table of Contents
Theoretical Perspectives on Crime.- Understanding "Criminogenic" Corporate Culture: What White-Collar Crime Researchers Can Learn from Studies of the Adolescent Employment-Crime Relationship.- General Strain Theory and White-Collar Crime.- Emergent Themes and Methodological Issues.- Persistent Heterogeneity or State Dependence? An Analysis of Occupational Safety and Health Act Violations.- White-Collar Crimes and the Fear of Crime: A Review.- The Role of Organizational Structure in the Control of Corporate Crime and Terrorism.- Globalization and White-Collar Crime.- Developmental Trajectories of White-Collar Crime.- Crime Prevention and Control.- White-Collar Crime from an Opportunity Perspective.- Self-Regulatory Approaches to White-Collar Crime: The Importance of Legitimacy and Procedural Justice.
- Volume
-
: Berlin ISBN 9783540095019
Table of Contents
and background.- Ehrenfeucht games and decision procedures.- Integer addition - An example of an Ehrenfeucht game decision procedure.- Some additional upper bounds.- Direct products of theories.- Lower bound preliminaries.- A technique for writing short formulas defining complicated properties.- A lower bound on the theories of pairing functions.- Some additional lower bounds.
by "Nielsen BookData"