Theory construction in psychology: The interpretation and integration of psychological data

DOI10.1007/BF00126282zbMath0469.92017OpenAlexW2069937339MaRDI QIDQ1157291

Gordon M. Becker, Eckehart Köhler

Publication date: 1981

Published in: Theory and Decision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00126282

zbMATH Keywords

theory constructioncomplexity measurementsurvey of developmentstheory evaluation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical psychology (91E99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The logical structure of mathematical physics
• A metric and an ordering on sets
• Prolegomena to a theory of mechanized formal reasoning
• Reasoning about programs
• Statistical quantifiers in observational calculi: An application in GUHA- methods
• Behaviorism, finite automata, and stimulus response theory
• From behaviorism to neobehaviorism
• Equivalence classes of functions of finite Markov chains
• Finite automata and S-R models
• Measurement structures and linear inequalities
• A new approach to the formulation and testing of learning models
• The GUHA method of automatic hypotheses determination
• Stimulus-response theory of inite automata
• Studies in the methodology and foundations of science. Selected papers from 1951 to 1969
• Information and inference
• Adaption and learning in automatic systems. Translated by Z. J. Nikolic
• Hypothesis generation by machine
• On the inference of Turing machines from sample computations
• Markov processes and learning models
• On a Measure of the Information Provided by an Experiment
• Information-Theoretical Aspects of Inductive and Deductive Inference
• Behavioristic Foundations of Utility
• On Multiplication of Polynomials Modulo a Polynomial
• RAMSEY ELIMINABILITY AND THE TESTABILITY OF SCIENTIFIC THEORIES
• Optimization by a Team of Independent Automata with Adaptation
• Data Types as Lattices
• On the Complexity of Finite Sequences
• Theoretical bounds on the complexity of inexact computations
• Computational Complexity of Multiple Recursive Schemata
• Causal Realization from Input-Output Pairs
• A test of finite-state theories of memory
• Learning Automata - A Survey
• Punish/Reward: Learning with a Critic in Adaptive Threshold Systems
• Information-theoretic computation complexity
• Identification and Control of Multivariable Stochastic Feedback Systems
• Two Breakthroughs in the Theory of Statistical Decision Making
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On the Length of Programs for Computing Finite Binary Sequences
• Economic Comparability of Information Systems
• On some metamathematical results as properties of general systems
• Economics of Information Systems
• Algorithms and Randomness
• An Overview of the Theory of Computational Complexity
• A New Approach to System Identification and State Estimation
• The definition of random sequences
• Stochastic Automata Models with Applications to Learning Systems
• A formal theory of inductive inference. Part I
• On the concept of a random sequence

This page was built for publication: Theory construction in psychology: The interpretation and integration of psychological data