Sciweavers

1101 search results - page 17 / 221
» Forcing in proof theory
Sort
View
ICRA
1999
IEEE
115views Robotics» more  ICRA 1999»
13 years 11 months ago
Design of a Spider-Like Robot for Motion with Quasistatic Force Constraints
Abstract: This paper presents a novel design of a Jiegged "spider" robot capable of moving in a wide range of two-dimensional tunnels. The spider moves in a quasistatic m...
Shraga Shoval, Elon Rimon, Amir Shapiro
FROCOS
2007
Springer
14 years 1 months ago
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
Viorica Sofronie-Stokkermans
ASIAN
2004
Springer
78views Algorithms» more  ASIAN 2004»
14 years 27 days ago
A Simple Theory of Expressions, Judgments and Derivations
We propose a simple theory of expressions which is intended to be used as a foundational syntactic structure for the Natural Framework (NF). We define expression formally and give...
Masahiko Sato
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 7 months ago
Graphical Presentations of Symmetric Monoidal Closed Theories
Abstract. We define a notion of symmetric monoidal closed (smc) theory, consisting of a smc signature augmented with equations, and describe the classifying categories of such theo...
Richard H. G. Garner, Tom Hirschowitz, Auré...
JIIS
2008
104views more  JIIS 2008»
13 years 7 months ago
A framework for checking proofs naturally
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
Masahiko Sato