We analyze the schema theorem and the building block hypothesis using a recently derived, exact schemata evolution equation. We derive a new schema theorem based on the concept of effective fitness showing that schemata of higher than average effective fitness receive an exponentially increasing number of trials over time. The building block hypothesis is a natural consequence in that the equat...

We address the problem of software invisibility and seek means to improve the comprehensibility of software. Architectural schemata are defined as visual “roadmaps” to the design of object oriented programs and construed in a formal language. We present LePUS Schemata, a formal language whose expressions convey architectural configurations and demonstrate its use in documenting the design, arch...

Recent developments in reification of ER schemata include automatic generation of webbased database administration systems [1,2]. These systems enforce the schema cardinality constraints, but, beyond unsatisfiable schemata, this feature may create unreachable instances. We prove sound and complete characterisations of schemata whose instances satisfy suitable reachability properties; these theo...

We analyze the schema theorem and the building block hypothesis using a recently derived, exact schemata evolution equation. We derive a new schema theorem based on the concept of eeective tness showing that schemata of higher than average eeective tness receive an exponentially increasing number of trials over time. The building block hypothesis is a natural consequence in that the equation sh...

Mechanism schemata are one of the least understood parts of MDC’s account of mechanistic explanation. Relatedly, there is a common misconception that there is no place for abstraction in MDC mechanisms. These two problems can be remedied by looking more carefully at what MDC say both in their 2000 paper and elsewhere about schemata and abstraction, and by following up on a comment of Machamer’s...

Cut-elimination is one of the most famous problems in proof theory, and it was defined and solved for first-order sequent calculus by Gentzen in his celebrated Hauptsatz. Ceres is a different cut-elimination algorithm for firstand higher-order classical logic. It is based on the notion of a characteristic set of clauses which is extracted from a proof in sequent calculus and is always unsatisfi...