On the public citation graph

Formalization of the Algebra of Nominative Data in Mizar

https://doi.org/10.15439/2017f301

0 signed · 52 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11542384openalex-snapshot

The Seventeen Provers of the World

inferredcites →https://doi.org/10.1007/3-540-36579-6_19openalex-snapshot

The Verifying Compiler: A Grand Challenge for Computing Research

inferredcites →https://doi.org/10.1007/978-3-319-08434-3openalex-snapshot

Intelligent Computer Mathematics

inferredcites →https://doi.org/10.1007/978-3-319-08434-3_27openalex-snapshot

Automated Improving of Proof Legibility in the Mizar System

inferredcites →https://doi.org/10.1007/978-3-319-08434-3_37openalex-snapshot

SAT-Enhanced Mizar Proof Checking

inferredcites →https://doi.org/10.1007/978-3-319-13206-8_6openalex-snapshot

On Algebraic Properties of Nominative Data and Functions

inferredcites →https://doi.org/10.1007/978-3-319-20615-8_17openalex-snapshot

Mizar: State-of-the-art and Beyond

inferredcites →https://doi.org/10.1007/978-3-319-42547-4_12openalex-snapshot

Enhancement of Mizar Texts with Transitivity Property of Predicates

inferredcites →https://doi.org/10.1007/978-3-540-27818-4_21openalex-snapshot

Improving Mizar Texts with Properties and Requirements

inferredcites →https://doi.org/10.1007/978-3-540-45213-3_4openalex-snapshot

The Verifying Compiler: A Grand Challenge for Computing Research

inferredcites →https://doi.org/10.1007/978-3-540-73451-2_17openalex-snapshot

Rough Set Theory from a Math-Assistant Perspective

inferredcites →https://doi.org/10.1007/978-3-642-14128-7_26openalex-snapshot

On Duplication in Mathematical Repositories

inferredcites →https://doi.org/10.1007/978-94-011-1793-7_4openalex-snapshot

Assigning Meanings to Programs

inferredcites →https://doi.org/10.1007/978-94-011-1793-7_5openalex-snapshot

An Axiomatic Basis for Computer Programming

inferredcites →https://doi.org/10.1007/s10817-012-9261-6openalex-snapshot

On Rewriting Rules in Mizar

inferredcites →https://doi.org/10.1007/s10817-015-9331-7openalex-snapshot

Definitional Expansions in Mizar

inferredcites →https://doi.org/10.1007/s10817-015-9332-6openalex-snapshot

Automating Boolean Set Operations in Mizar Proof Checking with the Aid of an External SAT Solver

inferredcites →https://doi.org/10.1007/s10817-015-9333-5openalex-snapshot

Mechanizing Complemented Lattices Within Mizar Type System

inferredcites →https://doi.org/10.1007/s10817-015-9337-1openalex-snapshot

Improving Legibility of Formal Proofs Based on the Close Reference Principle is NP-Hard

inferredcites →https://doi.org/10.1007/s10817-015-9345-1openalex-snapshot

Four Decades of Mizar

inferredcites →https://doi.org/10.1016/b978-0-12-195250-1.50015-1openalex-snapshot

Finite Time Blow-Up in Nonlinear Problems

inferredcites →https://doi.org/10.1016/j.amc.2015.10.080openalex-snapshot

Theoretical analysis for blow-up behaviors of differential equations with piecewise constant arguments

inferredcites →https://doi.org/10.1016/j.cl.2015.07.002openalex-snapshot

Flexary connectives in Mizar

inferredcites →https://doi.org/10.1080/00207160701864459openalex-snapshot

Interfacing external CA systems for Gröbner bases computation in M izar proof checking

inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot

Assigning meanings to programs

inferredcites →https://doi.org/10.1109/mcs.2008.931718openalex-snapshot

Hybrid dynamical systems

inferredcites →https://doi.org/10.1109/samos.2012.6404193openalex-snapshot

Rigorous design of cyber-physical systems

inferredcites →https://doi.org/10.1109/wcsp.2011.6096958openalex-snapshot

A survey of Cyber-Physical Systems

inferredcites →https://doi.org/10.1137/1032046openalex-snapshot

The Role of Critical Exponents in Blowup Theorems

inferredcites →https://doi.org/10.1142/3846openalex-snapshot

Integrability and Nonintegrability of Dynamical Systems

inferredcites →https://doi.org/10.1142/9789812811943openalex-snapshot

Integrability and Nonintegrability of Dynamical Systems

inferredcites →https://doi.org/10.1145/322186.322198openalex-snapshot

Fast Decision Procedures Based on Congruence Closure

inferredcites →https://doi.org/10.1515/9781400842636openalex-snapshot

Hybrid Dynamical Systems

inferredcites →https://doi.org/10.1515/forma-2017-0020openalex-snapshot

Simple-Named Complex-Valued Nominative Data – Definition and Basic Operations

inferredcites →https://doi.org/10.15439/2015f229openalex-snapshot

Equality in computer proof-assistants

inferredcites →https://doi.org/10.15439/2016f520openalex-snapshot

On algebraic hierarchies in mathematical repository of Mizar

inferredcites →https://doi.org/10.2168/lmcs-10(3:23)2014openalex-snapshot

Improving legibility of natural deduction proofs is not trivial

inferredcites →https://doi.org/10.6092/issn.1972-5787/1980openalex-snapshot

Mizar in a Nutshell

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-13929-2_4openalex-snapshot

Inference Rules for the Partial Floyd-Hoare Logic Based on Composition of Predicate Complement

inferred← citeshttps://doi.org/10.1007/978-3-030-39459-2_3openalex-snapshot

Expressibility in the Kleene Algebra of Partial Predicates with the Complement Composition

inferred← citeshttps://doi.org/10.1007/978-3-319-67229-8_16openalex-snapshot

Formalization of the Nominative Algorithmic Algebra in Mizar

inferred← citeshttps://doi.org/10.1007/978-3-319-76168-8_3openalex-snapshot

Extended Floyd-Hoare Logic over Relational Nominative Data

inferred← citeshttps://doi.org/10.1515/forma-2017-0020openalex-snapshot

Simple-Named Complex-Valued Nominative Data – Definition and Basic Operations

inferred← citeshttps://doi.org/10.2478/forma-2018-0002openalex-snapshot

Kleene Algebra of Partial Predicates

inferred← citeshttps://doi.org/10.2478/forma-2018-0011openalex-snapshot

On Algebras of Algorithms and Specifications over Uninterpreted Data

inferred← citeshttps://doi.org/10.2478/forma-2018-0012openalex-snapshot

On an Algorithmic Algebra over Simple-Named Complex-Valued Nominative Data

inferred← citeshttps://doi.org/10.2478/forma-2019-0017openalex-snapshot

Partial Correctness of a Factorial Algorithm

inferred← citeshttps://doi.org/10.2478/forma-2019-0018openalex-snapshot

Partial Correctness of a Power Algorithm

inferred← citeshttps://doi.org/10.2478/forma-2020-0016openalex-snapshot

Partial Correctness of a Fibonacci Algorithm

inferred← citeshttps://doi.org/10.2478/forma-2020-0024openalex-snapshot

General Theory and Tools for Proving Algorithms in Nominative Data Systems

inferred← citeshttps://doi.org/10.2478/forma-2020-0025openalex-snapshot

Partial Correctness of an Algorithm Computing Lucas Sequences

inferred← citeshttps://doi.org/10.55056/ceur-ws.org/vol-2104/paper_259.pdfopenalex-snapshot

On the Sequence Rule for the Floyd-Hoare Logic with Partial Pre- and Post-Conditions

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.