Technology, Economic Backwardness and Industrialisation — General Schema

1991 ◽  
pp. 131-166
Author(s):  
Ian Inkster
Keyword(s):  
General Schema

Acting on Knowledge

2017 ◽  
Author(s):  
Timothy Williamson
Keyword(s):  
Practical Reasoning ◽  
Philosophy Of Action ◽  
Plausible Account ◽  
Direction Of Fit ◽  
General Schema ◽  
Action Intention ◽  
Knowledge Norms

This chapter develops and refines the analogy between knowledge and action in Knowledge and its Limits. The general schema is: knowledge is to belief as action is to intention. The analogy reverses direction of fit between mind and world. The knowledge/belief side corresponds to the inputs to practical reasoning, the action/intention side to its outputs. Since desires are inputs to practical reasoning, the desire-as-belief thesis is considered sympathetically. When all goes well with practical reasoning, one acts on what one knows. Belief plays the same local role as knowledge, and intention as action, in practical reasoning. This is the appropriate setting to understand knowledge norms for belief and practical reasoning. Marginalizing knowledge in epistemology is as perverse as marginalizing action in the philosophy of action. Opponents of knowledge-first epistemology are challenged to produce an equally systematic and plausible account of the relation between the cognitive and the practical.

Cubical Agda: A dependently typed programming language with univalence and higher inductive types

2021 ◽  
Vol 31 ◽  
Author(s):  
ANDREA VEZZOSI ◽  
ANDERS MÖRTBERG ◽  
ANDREAS ABEL
Keyword(s):  
Programming Language ◽  
Type Theory ◽  
Type Checking ◽  
Dependent Type Theory ◽  
Wide Range ◽  
General Schema ◽  
Direct Definition ◽  
Inductive Types ◽  
Definition Of ◽  
Cubical Type Theory

Abstract Proof assistants based on dependent type theory provide expressive languages for both programming and proving within the same system. However, all of the major implementations lack powerful extensionality principles for reasoning about equality, such as function and propositional extensionality. These principles are typically added axiomatically which disrupts the constructive properties of these systems. Cubical type theory provides a solution by giving computational meaning to Homotopy Type Theory and Univalent Foundations, in particular to the univalence axiom and higher inductive types (HITs). This paper describes an extension of the dependently typed functional programming language Agda with cubical primitives, making it into a full-blown proof assistant with native support for univalence and a general schema of HITs. These new primitives allow the direct definition of function and propositional extensionality as well as quotient types, all with computational content. Additionally, thanks also to copatterns, bisimilarity is equivalent to equality for coinductive types. The adoption of cubical type theory extends Agda with support for a wide range of extensionality principles, without sacrificing type checking and constructivity.

General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part II

2003 ◽  
Vol 11 (2) ◽  
pp. 169-206 ◽  
Author(s):  
Riccardo Poli ◽  
Nicholas Freitag McPhee
Keyword(s):  
Genetic Programming ◽  
Schema Theory ◽  
Exact Formulation ◽  
Expected Number ◽  
Size Evolution ◽  
General Schema ◽  
Definition Of ◽  
Effective Fitness ◽  
Selection Of ◽  
Exact Definition

This paper is the second part of a two-part paper which introduces a general schema theory for genetic programming (GP) with subtree-swapping crossover (Part I (Poli and McPhee, 2003)). Like other recent GP schema theory results, the theory gives an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. The theory is based on a Cartesian node reference system, introduced in Part I, and on the notion of a variable-arity hyperschema, introduced here, which generalises previous definitions of a schema. The theory includes two main theorems describing the propagation of GP schemata: a microscopic and a macroscopic schema theorem. The microscopic version is applicable to crossover operators which replace a subtree in one parent with a subtree from the other parent to produce the offspring. Therefore, this theorem is applicable to Koza's GP crossover with and without uniform selection of the crossover points, as well as one-point crossover, size-fair crossover, strongly-typed GP crossover, context-preserving crossover and many others. The macroscopic version is applicable to crossover operators in which the probability of selecting any two crossover points in the parents depends only on the parents' size and shape. In the paper we provide examples, we show how the theory can be specialised to specific crossover operators and we illustrate how it can be used to derive other general results. These include an exact definition of effective fitness and a size-evolution equation for GP with subtree-swapping crossover.

Bacon’s Metaphysical Method

2021 ◽  
Vol 58 (3) ◽  
pp. 22-37
Author(s):  
Daniel Garber ◽  
Keyword(s):  
Scientific Method ◽  
Natural Philosophy ◽  
World View ◽  
Natural World ◽  
Scientific Domain ◽  
General Schema

In this paper, I would like to examine the method that Bacon proposes in Novum organum II.1-20 and illustrates with the example of the procedure for discovering the form of heat. One might think of a scientific method as a general schema for research into nature, one that can, in principle, be used independently of the particular conception of the natural world which one adopts, and independently of the particular scientific domain with which one is concerned. Indeed, Bacon himself suggested that as with logic, his method, or as he calls it there his “system of interpreting” is widely applicable to any domain, and not just to natural philosophy. [Novum organum I.127] Now, recent studies of Bacon have emphasized his own natural philosophical commitments, and the underlying conception of nature that runs through his writings. In my essay I argue that the method Bacon illustrates in Novum organum II is deeply connected to this underlying view of nature: far from being a neutral procedure for decoding nature, Bacon’s method is a tool for filling out the details of a natural philosophy built along the broad outlines of the Baconian world view.

Introduction: Logic and Logic Programming Languages

1998 ◽  
Author(s):  
Michael J. O’Donnell
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Historical Development ◽  
Theoretical Computer Science ◽  
Equational Logic ◽  
Computer Scientists ◽  
General Schema ◽  
Similarities And Differences ◽  
Logic Programming Languages ◽  
Order Predicate Calculus

Logic, according to Webster’s dictionary [Webster, 1987], is ‘a science that deals with the principles and criteria of validity of inference and demonstration: the science of the formal principles of reasoning.' Such 'principles and criteria’ are always described in terms of a language in which inference, demonstration, and reasoning may be expressed. One of the most useful accomplishments of logic for mathematics is the design of a particular formal language, the First Order Predicate Calculus (FOPC). FOPC is so successful at expressing the assertions arising in mathematical discourse that mathematicians and computer scientists often identify logic with classical logic expressed in FOPC. In order to explore a range of possible uses of logic in the design of programming languages, we discard the conventional identification of logic with FOPC, and formalize a general schema for a variety of logical systems, based on the dictionary meaning of the word. Then, we show how logic programming languages may be designed systematically for any sufficiently effective logic, and explain how to view Prolog, Datalog, λProlog, Equational Logic Programming, and similar programming languages, as instances of the general schema of logic programming. Other generalizations of logic programming have been proposed independently by Meseguer [Meseguer, 1989], Miller, Nadathur, Pfenning and Scedrov [Miller et al., 1991], Goguen and Burstall [Goguen and Burstall, 1992]. The purpose of this chapter is to introduce a set of basic concepts for understanding logic programming, not in terms of its historical development, but in a systematic way based on retrospective insights. In order to achieve a systematic treatment, we need to review a number of elementary definitions from logic and theoretical computer science and adapt them to the needs of logic programming. The result is a slightly modified logical notation, which should be recognizable to those who know the traditional notation. Conventional logical notation is also extended to new and analogous concepts, designed to make the similarities and differences between logical relations and computational relations as transparent as possible. Computational notation is revised radically to make it look similar to logical notation.

Can Dance Reflect the Structural and Expressive Qualities of Music? A Perceptual Experiment on Balanchine's Choreography of Mozart's Divertimento No. 15

1997 ◽  
Vol 1 (1) ◽  
pp. 63-85 ◽  
Author(s):  
Carol L. Krumhansl ◽  
Diana Lynn Schenck
Keyword(s):  
Emotional Response ◽  
Temporal Organization ◽  
Materials Analysis ◽  
George Balanchine ◽  
Bodily Movement ◽  
Interactive Relationship ◽  
New Ideas ◽  
On Line ◽  
General Schema ◽  
Stimulus Materials

A perceptual experiment investigated the structural and expressive mappings between music and dance. The Stimulus materials were based on the Minuetto from W. A. Mozart's Divertimento No. 15 choreographed by George Balanchine. Participants were assigned to one of three conditions: Music Only, Dance Only, and Both Music and Dance. They performed four on-line tasks: indicating the occurrence of section ends and new ideas, and judging the amount of tension and emotion expressed. Each of the tasks showed strong similarity across the three conditions, including the Music Only and the Dance Only conditions which contained none of the same Stimulus materials. Analysis of the music and dance uncovered a large variety of elements that define mappings between music and dance. These operate on different hierarchical levels and suggest non-accidental relationships between music and bodily movement. The Both Music and Dance condition could be predicted as a combination of the Music Only and Dance Only conditions, with a stronger contribution of the former. The findings for this excerpt suggest an additive, non-interactive relationship between the music and dance. All three conditions exhibited the same temporal pattern among the tasks. New ideas were introduced at section beginnings when levels of tension and emotion expressed were low. These levels tended to increase within sections, reaching a peak just before section ends. These results suggest that a general Schema of temporal Organization operates in both music and dance. Finally, the three conditions produced very similar judgments of the type of emotional response, supporting the idea that both music and dance can engage similar representations of emotions.

scholarly journals Schemes, Critical Questions, and Complete Argument Evaluation

Argumentation ◽  
2020 ◽  
Vol 34 (4) ◽  
pp. 469-498
Author(s):  
Shiyang Yu ◽  
Frank Zenker
Keyword(s):  
Critical Questions ◽  
Argument Evaluation ◽  
Central Task ◽  
Argument Schemes ◽  
Meta Level ◽  
Argument Scheme ◽  
General Schema ◽  
Object Level

Abstract According to the argument scheme approach, to evaluate a given scheme-saturating instance completely does entail asking all critical questions (CQs) relevant to it. Although this is a central task for argumentation theorists, the field currently lacks a method for providing a complete argument evaluation. Approaching this task at the meta-level, we combine a logical with a substantive approach to the argument schemes by starting from Toulmin’s schema: ‘data, warrant, so claim’. For the yet more general schema: ‘premise(s); if premise(s), then conclusion; so conclusion’, we forward a meta-level CQ-list that is arguably both complete and applicable. This list should inform ongoing theoretical efforts at generating appropriate object-level CQs for specific argument schemes.

scholarly journals Rara and theory testing in typology: The natural evolution of non‐canonical agreement

2021 ◽  
Author(s):  
Erich Round
Keyword(s):  
Main Clause ◽  
Theory Testing ◽  
Natural Evolution ◽  
Retrospective Case ◽  
Successful Development ◽  
Subordinate Clauses ◽  
General Schema ◽  
Person Agreement ◽  
Retrospective Case Study

In typology, rara provide valuable tests for theoretical hypotheses. Here I consider the rarum of PERSON inflection in Kayardild, which has only two surface contrasts but is found across all words in complementized subordinate clauses. I introduce a general schema for reasoning about the diachronic emergence of rara, and reconstruct the evolution of Kayardild subordinate PERSON agreement, from an earlier state in which a main‐clause inverse system was coupled to a system of complementizing CASE agreement. Serendipitously, the same synchronic facts have been analysed twice earlier without the benefit of the full diachronic backstory, and so present a retrospective case study in what diachrony offers for the analysis of rara, structures which by definition are difficult to contextualize using synchronic typology alone. I argue that since rara are so valuable for the testing of typological theories, and since diachrony may offer the only source of convincing explanation for them, it follows that typological science will need to refer to diachrony for the successful development of theory. It cannot rely on synchrony alone .

Optimal Synthesis of Topology for Compliant Mechanisms

2019 ◽  
Author(s):  
Antonio Caputi ◽  
Davide Russo
Keyword(s):  
Mechanical Response ◽  
Compliant Mechanisms ◽  
Design Tool ◽  
Physical Models ◽  
Synthesis Of Mechanisms ◽  
Response Set ◽  
Synthesis Tool ◽  
General Schema ◽  
Definition Of

Abstract The aim of the present work is disclosing a model suitable to provide a new tool for the synthesis of mechanisms and structures. Firstly, a framework will be introduced for the representation of a particular class of mechanisms: compliant mechanisms. For this purpose, the constitutive elements and the relations between the elements are organized in a taxonomy, similar to the ones used for the definition of ontologies. Ontologies have been taken as inspiration for the construction of the general schema for two main reasons: the first one is the need of consistency in the physical models, in order to obtain reliable results. The second reason is that one of the main features of ontologies is modularity, which means that they may be reused, and implemented for the creation of widest classifications. In the proposed framework, mechanisms result from the combination of the constitutive elements, according to a certain topology. The topologies are generated taking in account the defined feasible relations between elements. Once the mechanisms are defined, their behavior, in terms of mechanical response, is calculated and implemented in the schema as well. Finally, a classification of the evaluated mechanisms is provided, correlating the mechanical behavior of the mechanisms to the topological arrangement of their elements, or, in other words, their geometry. This classification may be synthetized in a table which may be query setting the mechanical response (set of deformation allowed or denied as response of a set of generalized forces). The result of the query is the indication of the topology of the mechanism that fits the mechanical response best. The proposed table is a design tool actually, suggesting the constructive form to the designer starting from a functional requirement. Moreover, considering the table of topologies and the physical model with which it was generated, they constitute a synthesis tool for that class of mechanisms, and, ultimately, a topology, and size optimization tool.

Sign in / Sign up

Export Citation Format

Share Document