Data

Tools

Indexes

Applications

Experiments

Open Source Science

buerer-s-inference

https://github.com/mosstone/buerer-s-inference

Science Score: 44.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • ✓
    CITATION.cff file
    Found CITATION.cff file
  • ✓
    codemeta.json file
    Found codemeta.json file
  • ✓
    .zenodo.json file
    Found .zenodo.json file
  • ○
    DOI references
  • ○
    Academic publication links
  • ○
    Academic email domains
  • ○
    Institutional organization owner
  • ○
    JOSS paper metadata
  • ○
    Scientific vocabulary similarity
    Low similarity (2.2%) to scientific vocabulary
Last synced: 9 months ago · JSON representation ·

Repository

Basic Info
  • Host: GitHub
  • Owner: Mosstone
  • License: mit
  • Default Branch: main
  • Size: 823 KB
Statistics
  • Stars: 0
  • Watchers: 1
  • Forks: 0
  • Open Issues: 0
  • Releases: 1
Created about 1 year ago · Last pushed about 1 year ago
Metadata Files
Readme License Citation

readme.md

Prerelease.

A radial chart indicating the relationship between every possible form of a value in predicate logic, allowing for a logician to immediately and accurately see every possible implied form without a long sequence of steps to infer the relationship between two forms

Expressed in forms usable for set theory and computational analysis, this is expected to show hightened efficiency in both contexts. Takes into account assumptions made about the set and the value being evaluated.

Citation (citation.cff) 

cff-version: 1.2.0
license: MIT License
message: "If you use this resource, please cite it as below."
authors:
- given-names: "Daniel" 
  family-names: "Buerer"
  orcid: "https://orcid.org/0009-0002-5084-0465"
title: "Buerer's Inference"
version: 1.0.0
doi: 10.5281/ZENODO.15424751
date-released: 2025-05-15
url: "https://github.com/Mosstone/Buerer-s-Inference"
abstract: >
  Prerelease.

  A radial chart indicating the relationship between every possible form of a value in predicate logic, allowing for 
  a logician to immediately and accurately see every possible implied form without a long sequence of steps to infer 
  the relationship between two forms

  Expressed in forms usable for set theory and computational analysis, this is expected to show hightened efficiency 
  in both contexts. Takes into account assumptions made about the set and the value being evaluated.

GitHub Events

Total
  • Release event: 1
  • Push event: 16
  • Create event: 2
Last Year
  • Release event: 1
  • Push event: 16
  • Create event: 2