Search results for "predicate logic"
showing 10 items of 170 documents
Testing a model for the monitoring of worked-out algebra-problem examples: from behaviours to outcomes on a math task
2021
This study aimed at testing an extension of a theoretical model for the metacognitive monitoring mechanism implied in the detection of inconsistencies when the information provided includes abstract symbols in addition to plain text. Ninety-four postgraduates of STEM specialities were asked to read a worked-out algebra-problem example and to report any incoherence, inconsistency, or error detected in the statement or in the solving procedure. A set of model inspired indexes was defined to describe participants¿ behaviour along the task. The Read & Answer software was used to record online individual processing data and participants¿ reports. Results supported model predictions. Indexes corr…
Towards Axiomatic Basis of Inductive Inference
2001
The language for the formulation of the interesting statements is, of course, most important. We use first order predicate logic. Our main achievement in this paper is an axiom system which we believe to be more powerful than any other natural general purpose discovery axiom system. We prove soundness of this axiom system in this paper. Additionally we prove that if we remove some of the requirements used in our axiom system, the system becomes not sound. We characterize the complexity of the quantifier prefix which guaranties provability of a true formula via our system. We prove also that if a true formula contains only monadic predicates, our axiom system is capable to prove this formula…
Sign test of independence between two random vectors
2003
A new affine invariant extension of the quadrant test statistic Blomqvist (Ann. Math. Statist. 21 (1950) 593) based on spatial signs is proposed for testing the hypothesis of independence. In the elliptic case, the new test statistic is asymptotically equivalent to the interdirection test by Gieser and Randles (J. Amer. Statist. Assoc. 92 (1997) 561) but is easier to compute in practice. Limiting Pitman efficiencies and simulations are used to compare the test to the classical Wilks’ test. peerReviewed
Delay in claim settlement and ruin probability approximations
1995
We introduce a general risk model for portfolios with delayed claims which is a natural extension of the classical Poisson model. We investigate ruin problems for different premium principles and provide approximations for the ruin probability. We conclude with some specific models, for example, for IBNR portfolios and portfolios where the pay-off process depends on the claim size.
Improvements and Modifications of Tarone's Multiple Test Procedure for Discrete Data
1998
Tarone (1990, Biometrics 46, 515-522) proposed a multiple test procedure for discrete test statistics improving the usual Bonferroni procedure. However, Tarone's procedure is not monotone depending on the predetermined multiple level a. Roth (1998, Journal of Statistical Planning and Inference, in press) developed a monotone version of Tarone's procedure. We present a similar procedure that is both monotone and an improvement of Tarone's proposal. Based on this extension, we derive a step-down procedure that is a corresponding improvement of Holm's (1979, Scandinavian Journal of Statistics 6, 65-70) sequentially rejective procedure. It is shown how adjusted p-values can be computed for the …
dglars: An R Package to Estimate Sparse Generalized Linear Models
2014
dglars is a publicly available R package that implements the method proposed in Augugliaro, Mineo, and Wit (2013), developed to study the sparse structure of a generalized linear model. This method, called dgLARS, is based on a differential geometrical extension of the least angle regression method proposed in Efron, Hastie, Johnstone, and Tibshirani (2004). The core of the dglars package consists of two algorithms implemented in Fortran 90 to efficiently compute the solution curve: a predictor-corrector algorithm, proposed in Augugliaro et al. (2013), and a cyclic coordinate descent algorithm, proposed in Augugliaro, Mineo, and Wit (2012). The latter algorithm, as shown here, is significan…
Modeling interactions between political parties and electors
2017
In this paper we extend some recent results on an operatorial approach to the description of alliances between political parties interacting among themselves and with a basin of electors. In particular, we propose and compare three different models, deducing the dynamics of their related {\em decision functions}, i.e. the attitude of each party to form or not an alliance. In the first model the interactions between each party and their electors are considered. We show that these interactions drive the decision functions towards certain asymptotic values depending on the electors only: this is the {\em perfect party}, which behaves following the electors' suggestions. The second model is an …
Implementability of Liouville Evolution, Koopman and Banach-Lamperti Theorems in Classical and Quantum Dynamics
2002
We extend the concept of implementability of semigroups of evolution operators associated with dynamical systems to quantum case. We show that such an extension can be properly formulated in terms of Jordan morphisms and isometries on non-commutative Lp spaces. We focus our attention on a non-commutative analog of the Banach-Lamperti theorem.
Large-distance asymptotic behaviour of multi-point correlation functions in massless quantum models
2014
We provide a microscopic model setting that allows us to readily access to the large-distance asymptotic behaviour of multi-point correlation functions in massless, one-dimensional, quantum models. The method of analysis we propose is based on the form factor expansion of the correlation functions and does not build on any field theory reasonings. It constitutes an extension of the restricted sum techniques leading to the large-distance asymptotic behaviour of two-point correlation functions obtained previously.
Extension theory and the calculus of butterflies
2016
Abstract This paper provides a unified treatment of two distinct viewpoints concerning the classification of group extensions: the first uses weak monoidal functors, the second classifies extensions by means of suitable H 2 -actions. We develop our theory formally, by making explicit a connection between (non-abelian) G-torsors and fibrations. Then we apply our general framework to the classification of extensions in a semi-abelian context, by means of butterflies [1] between internal crossed modules. As a main result, we get an internal version of Dedecker's theorem on the classification of extensions of a group by a crossed module. In the semi-abelian context, Bourn's intrinsic Schreier–M…